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

Authors:
P. Baptiste;F. Della Croce;A. Grosso;V. T'Kindt
Affiliations:
CNRS LIX, Ecole Polytechnique, Paris, France;D.A.I., Politecnico di Torino, Torino, Italy;D.I., Universitá di Torino, Torino, Italy;Laboratory of Computer Science, University of Tours, Tours, France
Venue:
Journal of Scheduling
Year:
2010

Citing 7
Cited 1

Algorithms for scheduling a single machine to minimize the weighted number of late jobs

Management Science
Single machine scheduling with deadlines to minimize the weighted number of tardy jobs

Management Science
A Computational Study of Search Strategies for Mixed Integer Programming

INFORMS Journal on Computing
Scheduling a Single Machine to Minimize the Number of Late Jobs

Scheduling a Single Machine to Minimize the Number of Late Jobs
An Exact Algorithm for the Two-Constraint 0--1 Knapsack Problem

Operations Research
An Exact Method to Minimize the Number of Tardy Jobs in Single Machine Scheduling

Journal of Scheduling
Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria

INFORMS Journal on Computing

An exact approach for scheduling jobs with regular step cost functions on a single machine

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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 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.