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

Authors:
A Grosso;F Della Croce;R Tadei
Affiliations:
Dipartimento di Informatica, Universití di Torino Corso Svizzera 185, 10149 Torino, Italy;Dipartimento di Automatica e Informatica, Politecnico di Torino Corso Duca degli Abruzzi 24, 10129 Torino, Italy;Dipartimento di Automatica e Informatica, Politecnico di Torino Corso Duca degli Abruzzi 24, 10129 Torino, Italy
Venue:
Operations Research Letters
Year:
2004

Citing 1
Cited 18

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

INFORMS Journal on Computing

Block approach: tabu search algorithm for single machine total weighted tardiness problem

Computers and Industrial Engineering
Hybrid heuristic algorithms for single machine total weighted tardiness scheduling problems

International Journal of Intelligent Systems Technologies and Applications
An experienced learning genetic algorithm to solve the single machine total weighted tardiness scheduling problem

Expert Systems with Applications: An International Journal
A population-based variable neighborhood search for the single machine total weighted tardiness problem

Computers and Operations Research
An exact algorithm for single-machine scheduling without machine idle time

Journal of Scheduling
Block approach-tabu search algorithm for single machine total weighted tardiness problem

Computers and Industrial Engineering
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
Hybrid metaheuristics in combinatorial optimization: A survey

Applied Soft Computing
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem

Computers and Operations Research
Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem

Mathematical and Computer Modelling: An International Journal
On the theoretical properties of swap multimoves

Operations Research Letters
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
A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time

Journal of Scheduling
On neighborhood tree search

Proceedings of the 14th annual conference on Genetic and evolutionary computation
An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times

Computers and Operations Research
Minimizing conditional-value-at-risk for stochastic scheduling problems

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on the work by Congram, Potts and Van de Velde, we develop for the single-machine total weighted tardiness scheduling problem an enhanced dynasearch neighborhood obtained by the generalized pairwise interchange (GPI) operators. Despite of the wider neighborhood considered, a fast search procedure using also elimination criteria is developed. The computational results significantly improve over those of Congram, Potts and Van de Velde.