Skip to Main content Skip to Navigation
Conference papers

The single machine just-in-time scheduling problem with preemptions

Yann Hendel 1 Francis Sourd 1
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : This paper deals with a variation of the single machine earliness/tardiness scheduling problem: preemption is allowed and, in order to penalize job interruptions, earliness costs depend on the starting time of the job while tardiness costs depend on the end times as in the usual models. We propose dominance properties and a polynomial time algorithm is given to solve the particular case where the sequence of the start and completion of the jobs is fixed.
Document type :
Conference papers
Complete list of metadatas
Contributor : Lip6 Publications <>
Submitted on : Tuesday, December 20, 2016 - 4:21:41 PM
Last modification on : Thursday, March 21, 2019 - 1:07:07 PM


  • HAL Id : hal-01420474, version 1


Yann Hendel, Francis Sourd. The single machine just-in-time scheduling problem with preemptions. Multidisciplinary International Conference on Scheduling: Theory and Applications, Jul 2005, New York, United States. pp.140-148. ⟨hal-01420474⟩



Record views