Sequencing a single machine with due dates and deadlines: an ILP-based approach - Archive ouverte HAL Access content directly
Journal Articles Journal of Scheduling Year : 2010

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

(1) , (2) , (3) , (4)
1
2
3
4

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

Dates and versions

hal-01003768 , version 1 (10-06-2014)

Identifiers

Cite

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⟩
81 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More