Article ID: | iaor20127737 |
Volume: | 40 |
Issue: | 6 |
Start Page Number: | 440 |
End Page Number: | 444 |
Publication Date: | Nov 2012 |
Journal: | Operations Research Letters |
Authors: | Sviridenko M, Queyranne M, Baptiste Ph, Carlier J, Kononov A, Sevastyanov S |
Keywords: | scheduling, combinatorial optimization |
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