Scheduling on identical parallel machines to minimize total completion time with deadline constraint and machine eligibility
碩士 === 中原大學 === 工業工程研究所 === 95 === This research considers the problem of scheduling identical parallel machine to minimizing total completion time with deadline constraint and machine eligibility. Jobs must complete its processing before or at its deadline and preemptions are not allowed. Every job...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/91215674551908465754 |