A minimum-cost network flow approach to preemptive parallel-machine scheduling

Authors:
Ling-Huey Su;T. C. E. Cheng;Fuh-Der Chou
Affiliations:
Department of Industrial and System Engineering, Chung-Yuan Christian University, Chung-Li, Taiwan, ROC;Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;Department of Industrial Engineering and Management, Ching-Yun University, Chung-Li, Taiwan, ROC
Venue:
Computers and Industrial Engineering
Year:
2013

Citing 5
Cited 0

Preemptive scheduling of uniform machines by ordinary network flow techniques

Management Science
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Nearly on line scheduling of preemptive independent tasks

Discrete Applied Mathematics - Special issue: Combinatorial Optimization 1992 (CO92)
Preemptive Scheduling with Release Times, Deadlines, and Due Times

Journal of the ACM (JACM)
Scheduling preemptable tasks on parallel processors with limited availability

Parallel Computing - Special issue on new trends on scheduling in parallel and distributed systems

Quantified Score

Hi-index	0.00

Visualization

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.