Integer preemptive scheduling on parallel machines

Integer preemptive scheduling on parallel machines

0.00 Avg rating0 Votes
Article ID: iaor20127737
Volume: 40
Issue: 6
Start Page Number: 440
End Page Number: 444
Publication Date: Nov 2012
Journal: Operations Research Letters
Authors: , , , , ,
Keywords: scheduling, combinatorial optimization
Abstract:

We consider preemptive machine scheduling problems on identical parallel machines. It is shown that every such problem with chain‐like precedence constraints, release dates and a regular unit‐concave objective function (e.g. total weighted tardiness and total weighted number of late jobs) has the following integer preemption property: for any problem instance with integral input data there exists an optimal schedule where all interruptions (as well as starting and completion times of jobs) occur at integer time points.

Reviews

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