New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling

Authors:
Francis Sourd
Affiliations:
Centre National de la Recherche Scientifique, LIP6 Laboratory, Université Pierre et Marie Curie, 75252 Paris, France
Venue:
INFORMS Journal on Computing
Year:
2009

Citing 19
Cited 6

An algorithm for solving the job-shop problem

Management Science
Sequencing with earliness and tardiness penalties: a review

Operations Research
Formulating the single machine sequencing problem with release dates as a mixed integer program

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Earliness-tardiness scheduling problems: I. Weighted derivation of completion times about a common due date

Operations Research
Earliness-tardiness scheduling problems: II. Derivation of completion times about a restrictive common due date

Operations Research
A time indexed formulation of non-preemptive single machine scheduling problems

Mathematical Programming: Series A and B
A branch and bound procedure to minimize mean absolute lateness on a single processor

Computers and Operations Research
An Implementation of Shor's r-Algorithm

Computational Optimization and Applications
Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates

Computers and Operations Research
Constraint-Based Scheduling

Constraint-Based Scheduling
A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Fully Polynomial Approximation Scheme for the Weighted Earliness-Tardiness Problem

Operations Research
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation

INFORMS Journal on Computing
Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem

INFORMS Journal on Computing
The One-Machine Problem with Earliness and Tardiness Penalties

Journal of Scheduling
The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions

INFORMS Journal on Computing
Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems

INFORMS Journal on Computing
Preemption in single machine earliness/tardiness scheduling

Journal of Scheduling
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem

Journal of Scheduling

An exact algorithm for single-machine scheduling without machine idle time

Journal of Scheduling
Fast neighborhood search for the single machine earliness-tardiness scheduling problem

Computers and Operations Research
An exact approach for scheduling jobs with regular step cost functions on a single machine

Computers and Operations Research
A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time

Journal of Scheduling
An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times

Computers and Operations Research
A linear programming-based method for job shop scheduling

Journal of Scheduling

Quantified Score

Hi-index	0.02

Visualization

Abstract

In one-machine scheduling, mixed-integer program time-indexed formulations are often used to provide very good lower bounds through Lagrangian relaxations. To get an improved lower bound, we add valid cuts to a time-indexed formulation and show we still have a Lagrangian relaxation that can be solved as a shortest path in a graph. Two branch-and-bound algorithms are then presented for the earliness-tardiness scheduling problem with either common or general due dates. In both cases, our algorithms outperform the previously published approaches.