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.
Type de document :
Communication dans un congrès
Multidisciplinary International Conference on Scheduling: Theory and Applications, Jul 2005, New York, United States. Multidisciplinary International Conference on Scheduling: Theory and Applications, pp.140-148
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01420474
Contributeur : Lip6 Publications <>
Soumis le : mardi 20 décembre 2016 - 16:21:41
Dernière modification le : mardi 11 décembre 2018 - 01:24:52

Identifiants

  • HAL Id : hal-01420474, version 1

Collections

Citation

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. Multidisciplinary International Conference on Scheduling: Theory and Applications, pp.140-148. 〈hal-01420474〉

Partager

Métriques

Consultations de la notice

43