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

Philippe Baptiste (1) , Federico Della Croce (2) , Andrea Grosso (3) , Vincent t'Kindt (4)

1 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
2 DAUIN - Department of Computer Engineering
3 Dipartimento di Informatica [Torino]
4 ERL CNRS 6305 Ordonnancement et Conduite

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

Keywords: Sequencing and scheduling; Single machine; Tardy jobs; Deadlines

Domains: Computer Science [cs]; Operations Research [cs.RO]

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, 2010, 13 (1), pp.39-47. ⟨10.1007/s10951-008-0092-6⟩. ⟨hal-01003768⟩