Skip to main content
Article thumbnail
Location of Repository

Beam search heuristics for quadratic earliness and tardiness scheduling

By Jorge M. S. Valente

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 procedures clearly outperform the best existing heuristic. The detailed beam search algorithm performs quite well, and is recommended for small to medium size instances. For larger instances, however, this procedure requires excessive computation times, and the recovering beam search algorithm then becomes the heuristic of choice.scheduling, heuristics, beam search, single machine, quadratic earliness, quadratic tardiness

OAI identifier:

Suggested articles

Citations

  1. (1999). A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem.
  2. A F S (2005a). Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time.
  3. A F S (2005b). Improved heuristics for the early/tardy scheduling problem with no idle time.
  4. A F S (2005c). Improved lower bounds for the early/tardy scheduling problem with no idle time.
  5. (1998). A heuristic to minimize a quadratic function of job lateness on a single machine.
  6. (1994). A pressing matter. Video :
  7. (2002). A recovering beam search algorithm for the one-machine dynamic total completion time scheduling problem.
  8. (2006). A recovering beam search algorithm for the single machine just-in-time scheduling problem.
  9. An exact approach for single machine scheduling with quadratic earliness and tardiness penalties. Working Paper 238, Faculdade de Economia, Universidade do
  10. (1988). Dynamic programming state-space relaxation for single machine scheduling.
  11. (1988). Filtered beam search in scheduling.
  12. (1993). Group technology and cellular manufacturing in the West24vaco Los Angeles VH department.
  13. Heuristics for the single machine scheduling problem with early and quadratic tardy penalties.
  14. (2005). Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach.
  15. (1983). Minimizing a quadratic function of job lateness on a single machine. Engineering Costs and Production Economics 7:
  16. (1995). Minimizing a weighted quadratic function of job lateness in the single machine system.
  17. (2002). Minimizing the sum of squares lateness on a single machine.
  18. (2005). Multicriteria scheduling.
  19. (2004). Recovering beam search: 23Enhancing the beam search approach for combinatorial problems.
  20. (2000). Scheduling with inserted idle time: Problem taxonomy and literature review.
  21. (1990). Sequencing with earliness and tardiness penalties: A review.
  22. (1997). Single machine earliness and tardiness scheduling.
  23. (2004). Single machine scheduling with early and quadratic tardy penalties.
  24. (1978). The ARGOS Image Understanding System.
  25. (1976). The HARPY Speech Recognition System.
  26. (1989). The single machine early/tardy problem.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.