Location of Repository

Greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties

By Jorge M. S. Valente and Maria R. A. Moreira

Abstract

In this paper, we present greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. The several heuristic versions differ, on the one hand, on the strategies involved in the construction of the greedy randomized schedules. On the other hand, these versions also differ on whether they employ only a final improvement step, or perform a local search after each greedy randomized construction. The proposed heuristics were compared with existing procedures, as well as with optimum solutions for some instance sizes. The computational results show that the proposed procedures clearly outperform their underlying dispatching heuristic, and the best of these procedures provide results that are quite close to the optimum. The best of the proposed algorithms is the new recommended heuristic for large instances, as well as a suitable alternative to the best existing procedure for the larger of the middle size instances.scheduling, single machine, early/tardy, quadratic penalties, greedy randomized dispatching rules

OAI identifier:

Suggested articles

Preview

Citations

  1. (2007a) An exact approach for single machine scheduling with quadratic earliness and tardiness penalties. Working Paper 238, Faculdade de Economia, Universidade do
  2. (2007b) Heuristics for the single machine scheduling problem with early and quadratic tardy penalties.
  3. (2008a) An exact approach for the single machine scheduling problem with linear early and quadratic tardy penalties.
  4. (2008b) Beam search heuristics for quadratic earliness and tardiness scheduling. Working Paper 279, Faculdade de Economia, Universidade do
  5. (1999). A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem.
  6. (1998). A heuristic to minimize a quadratic function of job lateness on a single machine.
  7. (1994). A pressing matter. Video February:46-50.
  8. Alves RAFS (2005a) Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time.
  9. Alves RAFS (2005b) Improved heuristics for the early/tardy scheduling problem with no idle time.
  10. Alves RAFS (2005c) Improved lower bounds for the early/tardy scheduling problem with no idle time.
  11. (1988). Dynamic programming state-space relaxation for single machine scheduling.
  12. (2005). Enhancing stochastic search performance by value-biased randomization of heuristics.
  13. (2003). Greedy randomized adaptive search procedures. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics.
  14. (1993). Group technology and cellular manufacturing in the Westvaco Los Angeles VH department.
  15. (1996). Heuristic-biased stochastic sampling. In:
  16. (2008). Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties.
  17. (1983). Minimizing a quadratic function of job lateness on a single machine. Eng Costs Prod Econ 7:187-194.
  18. (1995). Minimizing a weighted quadratic function of job lateness in the single machine system.
  19. (2002). Minimizing the sum of squares lateness on a single machine.
  20. (2005). Multicriteria scheduling.
  21. (2000). Scheduling with inserted idle time: Problem taxonomy and literature review.
  22. (1990). Sequencing with earliness and tardiness penalties: A review.
  23. (1997). Single machine earliness and tardiness scheduling.
  24. (2004). Single machine scheduling with early and quadratic tardy penalties.
  25. (1989). The single machine early/tardy problem.

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