Abstract
In this paper, we present beam search heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. These heuristics include classic beam search procedures, as well as filtered and recovering algorithms. We consider three dispatching heuristics as evaluation functions, in order to analyse the effect of different rules on the performance of the beam search procedures. The computational results show that using better dispatching heuristics improves the effectiveness of the beam search algorithms. The performance of the several heuristics is similar for instances with low variability. For high variability instances, however, the detailed, filtered and recovering beam search (RBS) procedures clearly outperform the best existing heuristic. The detailed beam search algorithm performs quite well, and is recommended for small- to medium-sized instances. For larger instances, however, this procedure requires excessive computation times, and the RBS algorithm then becomes the heuristic of choice.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abdul-Razaq T and Potts CN (1988). Dynamic programming state-space relaxation for single machine scheduling. J Opl Res Soc 39: 141–152.
Baker KR and Scudder GD (1990). Sequencing with earliness and tardiness penalties: A review. Opns Res 38: 22–36.
Della Croce F and T'kindt V (2002). A recovering beam search algorithm for the one-machine dynamic total completion time scheduling problem. J Opl Res Soc 53: 1275–1280.
Della Croce F, Ghirardi M and Tadei R (2004). Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems. J Heuristics 10: 89–104.
Esteve B, Aubijoux C, Chartier A and T'kindt V (2006). A recovering beam search algorithm for the single machine just-in-time scheduling problem. Eur J Opl Res 172: 798–813.
Ghirardi M and Potts CN (2005). Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach. Eur J Opl Res 165: 457–467.
Gupta SK and Sen T (1983). Minimizing a quadratic function of job lateness on a single machine. Eng Costs Prod Econ 7: 187–194.
Hoogeveen H (2005). Multicriteria scheduling. Eur J Opl Res 167: 592–623.
Kanet JJ and Sridharan V (2000). Scheduling with inserted idle time: Problem taxonomy and literature review. Opns Res 48: 99–110.
Korman K (1994). A pressing matter. Video February: pp 46–50.
Landis K (1993). Group technology and cellular manufacturing in the Westvaco Los Angeles VH department. Project Report in IOM 581, School of Business, University of Southern California.
Li G (1997). Single machine earliness and tardiness scheduling. Eur J Opl Res 96: 546–558.
Liaw CF (1999). A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. Comput Opns Res 26: 679–693.
Lowerre BT (1976). The HARPY speech recognition system. PhD thesis, Carnegie-Mellon University, USA.
Ow PS and Morton TE (1988). Filtered beam search in scheduling. Int J Prod Res 26: 35–62.
Ow PS and Morton TE (1989). The single machine early/tardy problem. Mngt Sci 35: 177–191.
Rubin S (1978). The ARGOS image understanding system. PhD thesis, Carnegie-Mellon University, USA.
Schaller J (2002). Minimizing the sum of squares lateness on a single machine. Eur J Opl Res 143: 64–79.
Schaller J (2004). Single machine scheduling with early and quadratic tardy penalties. Comput Ind Eng 46: 511–532.
Sen T, Dileepan P and Lind MR (1995). Minimizing a weighted quadratic function of job lateness in the single machine system. Int J Prod Econ 42: 237–243.
Su LH and Chang PC (1998). A heuristic to minimize a quadratic function of job lateness on a single machine. Int J Prod Econ 55: 169–175.
Valente JMS (2007a). An exact approach for single machine scheduling with quadratic earliness and tardiness penalties. Working Paper 238, Faculdade de Economia, Universidade do Porto, Portugal.
Valente JMS (2007b). Heuristics for the single machine scheduling problem with early and quadratic tardy penalties. Eur J Ind Eng 1: 431–448.
Valente JMS and Alves RAFS (2005a). Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time. Comput Ind Eng 48: 363–375.
Valente JMS and Alves RAFS (2005b). Improved heuristics for the early/tardy scheduling problem with no idle time. Comput Opns Res 32: 557–569.
Valente JMS and Alves RAFS (2005c). Improved lower bounds for the early/tardy scheduling problem with no idle time. J Opl Res Soc 56: 604–612.
Valente JMS and Alves RAFS (2008). Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties. Comp Opns Res 35: 3696–3713.
Acknowledgements
The author would like to thank the anonymous referees for several, and most useful, comments and suggestions that were used to improve this paper.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Valente, J. Beam search heuristics for quadratic earliness and tardiness scheduling. J Oper Res Soc 61, 620–631 (2010). https://doi.org/10.1057/jors.2008.191
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.2008.191