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

Authors:
F. Della Croce;E. Desmier;T. Garaix
Affiliations:
D.A.I., Politecnico di Torino, Torino, Italy;D.A.I., Politecnico di Torino, Torino, Italy;D.A.I., Politecnico di Torino, Torino, Italy
Venue:
Computers and Industrial Engineering
Year:
2011

Citing 7
Cited 0

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

INFORMS Journal on Computing
Dispatching heuristics for the single machine early/tardy scheduling problem with job-independent penalties

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

Journal of Scheduling
Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time

Computers and Industrial Engineering
An exact algorithm for single-machine scheduling without machine idle time

Journal of Scheduling
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a recent paper by Valente ''Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time''', Computers & Industrial Engineering, 55, 663-675, 2008, several beam search approaches are compared on a large set of instances of the total weighted earliness-tardiness problem on single machine with jobs independent weights and no machine idle time. That problem is denoted 1|nmit|@?"jhE"j+@?"jwT"j. This note points out that the standard iterated dynasearch procedure applied to that problem outperforms all the literature heuristics. Based on these results and others obtained on similar problems, we conclude that dynasearch for its efficiency and simplicity, should be used as a benchmark for future heuristics on those types of single machine no idle time problems.