The one-machine just-in-time scheduling problem with preemption - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Optimization Année : 2009

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

Résumé

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.

Dates et versions

hal-01185235 , version 1 (19-08-2015)

Identifiants

Citer

Yann Hendel, Nina Runge, Francis Sourd. The one-machine just-in-time scheduling problem with preemption. Discrete Optimization, 2009, 6 (1), pp.10-22. ⟨10.1016/j.disopt.2008.08.001⟩. ⟨hal-01185235⟩
108 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More