BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS

• Type: Article in International Scientific Journal
• Date: 2009

Authors

Jorge M S Valente (Author) FEP

Journal

Title: Asia-Pacific Journal of Operational Research

Vol. 26

Pages: 319-339

ISSN: 0217-5959

Publisher: World Scientific

Indexing

ISI Web of Knowledge - 15 Citations

ISI Web of Science

Scopus - 16 Citations

Scientific classification

FOS: Engineering and technology > Industrial biotechnology

CORDIS: Social sciences > Economics > Management studies

Other information

Authenticus ID: P-003-JAT

DOI: 10.1142/s0217595909002225

Abstract (EN): In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time. We present heuristic algorithms based on the beam search technique. These algorithms include classic beam search procedures, as well as the filtered and recovering variants. Several dispatching rules are considered as evaluation functions, to analyze the effect of different rules on the effectiveness of the beam search algorithms. The computational results show that using better rules improves the performance of the beam search heuristics. The detailed, filtered beam search (FBS) and recovering beam search (RBS) procedures outperform the best existing heuristic. The best results are given by the recovering and detailed variants, which provide objective function values that are quite close to the optimum. For small to medium size instances, either of these procedures can be used. For larger instances, the detailed beam search (DBS) algorithm requires excessive computation times, and the RBS procedure then becomes the heuristic of choice.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 21