Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01185235
Contributor : Lip6 Publications <>
Submitted on : Wednesday, August 19, 2015 - 3:09:44 PM
Last modification on : Friday, October 4, 2019 - 3:52:04 PM

Identifiers

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⟩

Share

Metrics

Record views

178