Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints

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

Citing 4
Cited 5

An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem

INFORMS Journal on Computing
A survey of very large-scale neighborhood search techniques

Discrete Applied Mathematics
Earliness-tardiness scheduling with setup considerations

Computers and Operations Research
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem

Operations Research Letters

Exponential neighborhood search for a parallel machine scheduling problem

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

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

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

A large dynasearch neighborhood is introduced for the one-machine scheduling problem with sequence-dependent setup times and costs and earliness-tardiness penalties. Finding the best schedule in this neighborhood is NP-complete in the ordinary sense but can be done in pseudo-polynomial time. We also present experimental results.