Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances

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 violated. We propose an exact method based on a compact integer linear programming formulation of the problem and an effective reduction procedure t...

Full description

Saved in:
Bibliographic Details
Published inJournal of scheduling Vol. 13; no. 1; pp. 39 - 47
Main Authors Baptiste, P., Della Croce, F., Grosso, A., T’kindt, V.
Format Journal Article
LanguageEnglish
Published Boston Springer US 01.02.2010
Springer Nature B.V
Subjects
Algorithms
Artificial Intelligence
Business and Management
Calculus of Variations and Optimal Control; Optimization
Deadlines
Dynamic programming
Integer programming
Linear programming
Operations Research/Decision Theory
Optimization
Production scheduling
Release dates
Sequential scheduling
Studies
Supply Chain Management
Sequencing and scheduling
Deadlines
Single machine
Tardy jobs
Online AccessGet full text

Cover

More Information
Summary: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 violated. We propose an exact method based on a compact integer linear programming formulation of the problem and an effective reduction procedure that allows to solve to optimality instances with up to 30,000 jobs in size, and up to 50,000 jobs in size for the special deadline-free case.
ISSN:1094-6136
1099-1425
DOI:10.1007/s10951-008-0092-6