Beam search heuristics for the single machine scheduling problem with linear earliness and quadratic tardiness costs

Asia-Pacific Journal of Operational Research

Volumn 26, Issue 3, 2009, Pages 319-339

  Valente, Jorge M S ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

Beam search; Heuristics; Linear earliness; Quadratic tardiness; Scheduling; Single machine

Indexed keywords

BEAM SEARCH; HEURISTICS; LINEAR EARLINESS; QUADRATIC TARDINESS; SINGLE MACHINE;

COMPUTATION THEORY; HEURISTIC METHODS; LEARNING ALGORITHMS; MACHINERY; SCHEDULING ALGORITHMS;

HEURISTIC ALGORITHMS;

EID: 68949184410     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0217595909002225     Document Type: Article

References (25)

1. Baker, KR and GD Scudder (1990). Sequencing with earliness and tardiness penalties: A review. Operations Research, 38, 22-36.
2. Della Croce, F, M Ghirardi and R Tadei (2004). Recovering beam search: Enhancing the beam search approach for combinatorial problems. Journal of Heuristics, 10, 89-104.
3. Delia Croce, F and V T'kindt (2002). A recovering beam search algorithm for the one-machine dynamic total completion time scheduling problem. Journal of the Operational Research Society, 53, 1275-1280.
4. Esteve, B, C Aubijoux, A Chartier and V T'kindt (2006). A recovering beam search algorithm for the single machine just-in-time scheduling problem. European Journal of Operational Research, 172, 798-813.
5. Garey, MR, RE Tarjan and GT Wilfong (1988). One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research, 13, 330-348.
6. Ghirardi, M and CN Potts (2005). Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach. European Journal of Operational Research, 165, 457-467.
7. Gupta, SK and T Sen (1983). Minimizing a quadratic function of job lateness on a single machine. Engineering Costs and Production Economics, 7, 187-194.
8. Hall, N, W Kubiak and S Sethi (1991). Earliness-tardiness scheduling problems, {II}: Deviation of completion times about a restrictive common due date. Operations Research, 39, 847-856.
9. Hoogeveen, H (2005). Multicriteria scheduling. European Journal of Operational Research, 167, 592-623.
10. Kanet, JJ and V Sridharan (2000). Scheduling with inserted idle time: Problem taxonomy and literature review. Operations Research, 48, 99-110.
11. Kim, YD and CA Yano (1994). Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates. Naval Research Logistics, 41, 913-933.
12. Kubiak, W (1993). Completion time variance minimization on single machine is difficult. Operations Research Letters, 14, 49-59.
13. Lowerre, BT (1976). The HARPY Speech Recognition System. PhD Thesis, Carnegie-Mellon University, USA.
14. Ow, PS and TE Morton (1988). Filtered beam search in scheduling. International Journal of Production Research, 26, 35-62.
15. Ow, PS and TE Morton (1989). The single machine early/tardy problem. Management Science, 35, 177-191.
16. Rubin, S (1978). The ARGOS Image Understanding System. PhD Thesis, Carnegie-Mellon University, USA.
17. Schaller, J (2002). Minimizing the sum of squares lateness on a single machine. European Journal of Operational Research, 143, 64-79.
18. Schaller, J (2004). Single machine scheduling with early and quadratic tardy penalties. Computers & Industrial Engineering, 46, 511-532.
19. Schaller, J (2007). A comparison of lower bounds for the single-machine early/tardy problem. Computers & Operations Research, 34, 2279-2292.
20. Sen, T, P Dileepan and MR Lind (1995). Minimizing a weighted quadratic function of job lateness in the single machine system. International Journal of Production Economics, 42, 237-243.
21. Su, L-H and P-C Chang (1998). A heuristic to minimize a quadratic function of job lateness on a single machine. International Journal of Production Economics, 55, 169-175.
22. Taguchi, G (1986). Introduction to Quality Engineering. Asian Productivity Organization, Tokyo, Japan.
23. Valente, JMS (2007). Heuristics for the single machine scheduling problem with early and quadratic tardy penalties. European Journal of Industrial Engineering, 1, 431-448.
24. Valente, JMS (2008). An exact approach for the single machine scheduling problem with linear early and quadratic tardy penalties. Asia-Pacific Journal of Operational Research, 25, 169-186.
25. Valente, JMS and RAFS Alves (2005). Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time. Computers & Industrial Engineering, 48, 363-375.