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

Authors:
Francis Sourd;Safia Kedad-Sidhoum
Affiliations:
LIP6, CNRS, Paris, France 75252;LIP6, Université Pierre et Marie Curie, Paris, France 75252
Venue:
Journal of Scheduling
Year:
2008

Citing 16
Cited 9

One-processor scheduling with symmetric earliness and tardiness penalties

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

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

Mathematical Programming: Series A and B
Scheduling identical parallel machines to minimize total weighted completion time

CO89 Selected papers of the conference on Combinatorial Optimization
A branch and bound procedure to minimize mean absolute lateness on a single processor

Computers and Operations Research
Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties

Mathematics of Operations Research
A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem

Computers and Operations Research
The One-Machine Problem with Earliness and Tardiness Penalties

Journal of Scheduling
Solving Project Scheduling Problems by Minimum Cut Computations

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

INFORMS Journal on Computing
Machine scheduling with earliness, tardiness and non-execution penalties

Computers and Operations Research
Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems

INFORMS Journal on Computing
An exact approach to early/tardy scheduling with release dates

Computers and Operations Research
Preemption in single machine earliness/tardiness scheduling

Journal of Scheduling
Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey

Mathematical and Computer Modelling: An International Journal
Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints

Operations Research Letters

A new model for the preemptive earliness-tardiness scheduling problem

Computers and Operations Research
New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling

INFORMS Journal on Computing
Fast neighborhood search for the single machine earliness-tardiness scheduling problem

Computers and Operations Research
Technical Note: A note on "Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time"

Computers and Industrial Engineering
A genetic algorithm for JIT single machine scheduling with preemption and machine idle time

Expert Systems with Applications: An International Journal
The one-machine just-in-time scheduling problem with preemption

Discrete Optimization
A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time

Journal of Scheduling
Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties

Computers and Operations Research
Single machine scheduling with controllable processing times to minimize total tardiness and earliness

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the one-machine scheduling problem with earliness-tardiness penalties. We propose a new branch-and-bound algorithm that can solve instances with up to 50 jobs and that can solve problems with even more general non-convex cost functions. The algorithm is based on the combination of a Lagrangean relaxation of resource constraints and new dominance rules.