HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Single-machine common due date total earliness/tardiness scheduling with machine unavailability

Kerem Bülbül 1 Safia Kedad-Sidhoum 2, 3 Halil Şen 4
2 CEDRIC - OC - CEDRIC. Optimisation Combinatoire
CEDRIC - Centre d'études et de recherche en informatique et communications
4 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : Research on non-regular performance measures is at best scarce in the deterministic machine scheduling literature with machine unavailability constraints. Moreover, almost all existing works in this area assume either that processing on jobs interrupted by an interval of machine unavailability may be resumed without any additional setup/processing or that all prior processing is lost. In this work, we intend to partially fill these gaps by studying the problem of scheduling a single machine as to minimize the total deviation of the job completion times from an unre-strictive common due date when one or several fixed intervals of unavailability are present in the planning horizon. We also put a serious effort into investigating models with semi-resumable jobs so that processing on a job interrupted by an interval of machine unavailability may later be resumed at the expense of some extra processing time. The conventional assumptions regarding resumability are also taken into account. Several interesting cases are identified and explored, depending on the resumability scheme and the location of the interval of machine unavailability with respect to the common due date. The focus of analysis is on structural properties and drawing the boundary between polynomially solvable and NP−complete cases. Pseudo-polynomial dynamic programming algorithms are devised for NP−complete variants in the ordinary sense.
Document type :
Journal articles
Complete list of metadata

Cited literature [44 references]  Display  Hide  Download

Contributor : Safia Kedad-Sidhoum Connect in order to contact the contributor
Submitted on : Friday, February 7, 2020 - 11:30:41 AM
Last modification on : Wednesday, March 16, 2022 - 3:48:41 AM
Long-term archiving on: : Friday, May 8, 2020 - 3:30:15 PM


Files produced by the author(s)



Kerem Bülbül, Safia Kedad-Sidhoum, Halil Şen. Single-machine common due date total earliness/tardiness scheduling with machine unavailability. Journal of Scheduling, Springer Verlag, 2019, 22 (5), pp.543-565. ⟨10.1007/s10951-018-0585-x⟩. ⟨hal-02470377⟩



Record views


Files downloads