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

0.00 Avg rating—0 Votes

Article ID:	iaor2013330
Volume:	64
Issue:	1
Start Page Number:	453
End Page Number:	458
Publication Date:	Jan 2013
Journal:	Computers & Industrial Engineering
Authors:	Su Ling-Huey, Chou Fuh-Der, Cheng T C E
Keywords:	networks: flow

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.

Reviews

Required fields are marked *. Your email address will not be published.