Integer preemptive scheduling on parallel machines - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Article Dans Une Revue Operations Research Letters Année : 2012

Integer preemptive scheduling on parallel machines

Résumé

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.

Dates et versions

hal-00781570 , version 1 (27-01-2013)

Identifiants

Citer

Philippe Baptiste, Jacques Carlier, Alexander Kononov, Maurice Queyranne, Sergey Sevastyanov, et al.. Integer preemptive scheduling on parallel machines. Operations Research Letters, 2012, 40 (6), pp.440-444. ⟨10.1016/j.orl.2012.06.011⟩. ⟨hal-00781570⟩
101 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More