 |
|
Journal articles
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
https://hal-univ-tours.archives-ouvertes.fr/hal-01003768
Contributor : Vincent T'Kindt Connect in order to contact the contributor
Submitted on : Tuesday, June 10, 2014 - 4:16:05 PM
Last modification on : Monday, February 7, 2022 - 4:06:03 PM
Contributor : Vincent T'Kindt Connect in order to contact the contributor
Submitted on : Tuesday, June 10, 2014 - 4:16:05 PM
Last modification on : Monday, February 7, 2022 - 4:06:03 PM
Links full text
