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

Jorge M. S. Valente ()
Additional contact information
Jorge M. S. Valente: LIAAD, Faculdade de Economia, Universidade do Porto, Portugal

Asia-Pacific Journal of Operational Research (APJOR), 2009, vol. 26, issue 03, 319-339

Abstract: 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.

Keywords: Scheduling; single machine; linear earliness; quadratic tardiness; beam search; heuristics (search for similar items in EconPapers)
Date: 2009
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595909002225
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:26:y:2009:i:03:n:s0217595909002225

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595909002225

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().