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

Authors:
Safia Kedad-Sidhoum;Francis Sourd
Affiliations:
Université Pierre et Marie Curie, Laboratoire LIP6, UMR7606 4, place Jussieu, 75 252 Paris Cedex 05, France;Université Pierre et Marie Curie, Laboratoire LIP6, UMR7606 4, place Jussieu, 75 252 Paris Cedex 05, France
Venue:
Computers and Operations Research
Year:
2010

Citing 10
Cited 1

Design of Iterated Local Search Algorithms

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem

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

INFORMS Journal on Computing
An improved earliness-tardiness timing algorithm

Computers and Operations Research
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
New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling

INFORMS Journal on Computing
Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints

Operations Research Letters
Fast neighborhood search for the single machine total weighted tardiness problem

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

Operations Research Letters

A linear programming-based method for job shop scheduling

Journal of Scheduling

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper addresses the one machine scheduling problem in which n jobs have distinct due dates with earliness and tardiness costs. Fast neighborhoods are proposed for the problem. They are based on a block representation of the schedule. A timing operator is presented as well as swap and extract-and-reinsert neighborhoods. They are used in an iterated local search framework. Two types of perturbations are developed based, respectively, on random swaps and earliness and tardiness costs. Computational results show that very good solutions for instances with significantly more than 100 jobs can be derived in a few seconds.