Properties of optimal schedules in preemptive shop scheduling

Philippe Baptiste (1, 2) , Jacques Carlier (2) , Alexander Kononov (3) , Maurice Queyranne (4) , Sergey Sevastyanov (3) , Maxim Sviridenko (5)

1 X - École polytechnique
2 Heudiasyc - Heuristique et Diagnostic des Systèmes Complexes [Compiègne]
3 Sobolev Institute of Mathematics
4 UBC - University of British Columbia
5 Department of Computer Science [Warwick]

In this work we show that certain classical preemptive shop scheduling problems with integral data satisfy the following integer preemption property: there exists an optimal preemptive schedule where all interruptions and all starting and completion times occur at integral dates. We also give new upper bounds on the minimal number of interruptions for various shop scheduling problems.

Mots clés: Shop scheduling; Preemptions

Domaines: Recherche opérationnelle [math.OC]

Philippe Baptiste, Jacques Carlier, Alexander Kononov, Maurice Queyranne, Sergey Sevastyanov, et al.. Properties of optimal schedules in preemptive shop scheduling. Discrete Applied Mathematics, 2011, 159 (5), pp.272-280. ⟨10.1016/j.dam.2010.11.015⟩. ⟨hal-01306521⟩