Earliness-tardiness scheduling with setup considerations

Authors:
Francis Sourd
Affiliations:
Université Pierre et Marie Curie-LIP6 4, place Jussieu, 75252 Paris Cedex 05, France
Venue:
Computers and Operations Research
Year:
2005

Citing 12
Cited 7

One-processor scheduling with symmetric earliness and tardiness penalties

Mathematics of Operations Research
Sequencing with earliness and tardiness penalties: a review

Operations Research
Nondifferentiable optimization

Optimization
Early/tardy scheduling with sequence dependent setups on uniform parallel machines

Computers and Operations Research
Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach

Computers and Industrial Engineering
PERT scheduling with convex cost functions

Theoretical Computer Science
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation

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

Journal of Scheduling
A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time

Computers and Operations Research
The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions

INFORMS Journal on Computing
Multicriteria Scheduling: Theory, Models and Algorithms

Multicriteria Scheduling: Theory, Models and Algorithms
The complexity of scheduling job families about a common due date

Operations Research Letters

Parallel machine scheduling with precedence constraints and setup times

Computers and Operations Research
Parallel machine scheduling problem to minimize the earliness/tardiness costs with learning effect and deteriorating jobs

Journal of Intelligent Manufacturing
Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints

Operations Research Letters
The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times

Discrete Optimization
Scheduling a single machine to minimize a regular objective function under setup constraints

Discrete Optimization
An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times

Computers and Operations Research
Artificial chromosomes with genetic algorithm 2 (ACGA2) for single machine scheduling problems with sequence-dependent setup times

Applied Soft Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

The one-machine scheduling problem with sequence-dependent setup times and costs and earliness-tardiness penalties is addressed. A time-indexed formulation of the problem is presented as well as different relaxations that give lower bounds of the problem. Then, a branch-and-bound procedure based on one of these lower bounds is presented. The efficiency of this algorithm also relies on new dominance rules and on a heuristic to derive good feasible schedules. Computational tests are finally presented.