Scheduling on identical parallel machines to minimize total completion time with deadline constraint and machine eligibility

• Main Authors: Cheng-Chao Lin, 林正超
• Other Authors: Ling-Huey Su
• Format: Others
• Language: zh-TW
• Published: 2007
• Online Access: http://ndltd.ncl.edu.tw/handle/91215674551908465754

碩士 === 中原大學 === 工業工程研究所 === 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 is allowed to be processed on a specified subset of machines. The problem is strongly NP-hard for which the heuristic and the branch and bound are proposed. Some properties will be established and exploited to design the solution method of the heuristic and the branch and bound. And the computational results will be reported.