The one-machine just-in-time scheduling problem with preemption

Yann Hendel 1 Nina Runge 1 Francis Sourd 1
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : This paper investigates the notion of preemption in scheduling, with earliness and tardiness penalties. Starting from the observation that the classical cost model where penalties only depend on completion times does not capture the just-in-time philosophy, we introduce a new model where the earliness costs depend on the start times of the jobs. To solve this problem, we propose an efficient representation of dominant schedules, and a polynomial algorithm to compute the best schedule for a given representation. Both a local search algorithm and a branch-and-bound procedure are then derived. Experiments finally show that the gap between our upper bound and the optimum is very small.
Type de document :
Article dans une revue
Discrete Optimization, Elsevier, 2009, 6 (1), pp.10-22. 〈10.1016/j.disopt.2008.08.001〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01185235
Contributeur : Lip6 Publications <>
Soumis le : mercredi 19 août 2015 - 15:09:44
Dernière modification le : vendredi 14 décembre 2018 - 01:28:55

Lien texte intégral

Identifiants

Collections

Citation

Yann Hendel, Nina Runge, Francis Sourd. The one-machine just-in-time scheduling problem with preemption. Discrete Optimization, Elsevier, 2009, 6 (1), pp.10-22. 〈10.1016/j.disopt.2008.08.001〉. 〈hal-01185235〉

Partager

Métriques

Consultations de la notice

63