Sequencing a single machine with due dates and deadlines: an ILP-based approach

Abstract : We consider the problem of minimizing the weighted number of tardy jobs on a single machine where each job is also subject to a deadline that cannot be vio- lated. We propose an exact method based on a compact in- teger linear programming formulation of the problem and an effective reduction procedure that allows to solve to op- timality instances with up to 30,000 jobs in size, and up to 50,000 jobs in size for the special deadline-free case
Document type :
Journal articles
Complete list of metadatas

https://hal-univ-tours.archives-ouvertes.fr/hal-01003768
Contributor : Vincent t'Kindt <>
Submitted on : Tuesday, June 10, 2014 - 4:16:05 PM
Last modification on : Tuesday, June 11, 2019 - 10:18:01 AM

Links full text

Identifiers

Collections

Citation

Philippe Baptiste, Federico Della Croce, Andrea Grosso, Vincent t'Kindt. Sequencing a single machine with due dates and deadlines: an ILP-based approach. Journal of Scheduling, Springer Verlag, 2010, 13 (1), pp.39-47. ⟨10.1007/s10951-008-0092-6⟩. ⟨hal-01003768⟩

Share

Metrics

Record views

150