Minimize the total completion times on parallel machines subject to both machine eligibilities resource constraints
碩士 === 中原大學 === 工業與系統工程研究所 === 105 === This study considers the identical parallel machine scheduling problem with arrival times, machine eligibility and resource constraints. Machine eligibility means that not all machines can process all jobs. Each job requires resource. There is upper limit on ea...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/cgi-bin/gs32/gsweb.cgi/login?o=dnclcdr&s=id=%22105CYCU5030058%22.&searchmode=basic |