|
|||||
|
|
A minimum-cost network flow approach to preemptive parallel-machine scheduling |
|
| Authors: | Ling-Huey Su T.C.E. Cheng Fuh-Der Chou |
| Affiliation: | 1. Department of Industrial and System Engineering, Chung-Yuan Christian University, Chung-Li, Taiwan, ROC;2. Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;3. Department of Industrial Engineering and Management, Ching-Yun University, Chung-Li, Taiwan, ROC |
| Abstract: | We model and solve the problems of preemptive scheduling of n independent jobs with release dates on m parallel machines with machine availability and eligibility constraints to minimize the makespan and maximum lateness as the minimum-cost network flow problem. We show that the approach can be extended to solve the corresponding scheduling problems on two uniform parallel machines. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |