Skip to main content
SpringerLink
Log in

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

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

In this paper, we present greedy randomised 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 randomised 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 randomised 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-sized instances.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abdul-Razaq T, Potts CN (1988) Dynamic programming state-space relaxation for single machine scheduling. J Oper Res Soc 39:141–152

    Article  MATH  Google Scholar 

  2. Baker KR, Scudder GD (1990) Sequencing with earliness and tardiness penalties: a review. Oper Res 38:22–36. doi:10.1287/opre.38.1.22

    Article  MATH  MathSciNet  Google Scholar 

  3. Bresina JL (1996) Heuristic-biased stochastic sampling. Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, vol 1. AAAI, CA, pp 271–278

  4. Cicirello VA, Smith SF (2005) Enhancing stochastic search performance by value-biased randomization of heuristics. J Heuristics 11:5–34. doi:10.1007/s10732-005-6997-8

    Article  MATH  Google Scholar 

  5. Gupta SK, Sen T (1983) Minimizing a quadratic function of job lateness on a single machine. Eng Costs Prod Econ 7:187–194. doi:10.1016/0167-188X(83)90012-5

    Article  Google Scholar 

  6. Hoogeveen H (2005) Multicriteria scheduling. Eur J Oper Res 167:592–623. doi:10.1016/j.ejor.2004.07.011

    Article  MATH  MathSciNet  Google Scholar 

  7. Kanet JJ, Sridharan V (2000) Scheduling with inserted idle time: problem taxonomy and literature review. Oper Res 48:99–110. doi:10.1287/opre.48.1.99.12447

    Article  Google Scholar 

  8. Korman K (1994) A pressing matter. Video. February, pp 46–50

  9. Kubiak W (1993) Completion time variance minimization on single machine is difficult. Oper Res Lett 14:49–59. doi:10.1016/0167-6377(93)90019-D

    Article  MATH  MathSciNet  Google Scholar 

  10. 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

  11. Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Discret Math 1:343–362. doi:10.1016/S0167-5060(08)70743-X

    Article  MathSciNet  Google Scholar 

  12. Li G (1997) Single machine earliness and tardiness scheduling. Eur J Oper Res 96:546–558. doi:10.1016/S0377-2217(96)00062-8

    Article  MATH  Google Scholar 

  13. Liaw CF (1999) A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. Comput Oper Res 26:679–693. doi:10.1016/S0305-0548(98)00081-1

    Article  MATH  MathSciNet  Google Scholar 

  14. Lin S-W, Ying K-C (2007) Solving single-machine total weighted tardiness problems with sequence-dependent setup times by meta-heuristics. Int J Adv Manuf Technol 34:1183–1190. doi:10.1007/s00170-006-0693-1

    Article  Google Scholar 

  15. Maheswaran R, Ponnambalam SG (2003) An investigation on single machine total weighted tardiness scheduling problems. Int J Adv Manuf Technol 22:243–248. doi:10.1007/s00170-002-1466-0

    Article  Google Scholar 

  16. Maheswaran R, Ponnambalam SG (2005) An intensive search evolutionary algorithm for single-machine total-weighted-tardiness scheduling problems. Int J Adv Manuf Technol 26:1150–1156. doi:10.1007/s00170-004-2093-8

    Article  Google Scholar 

  17. Ow PS, Morton TE (1989) The single machine early/tardy problem. Manage Sci 35:177–191. doi:10.1287/mnsc.35.2.177

    Article  MATH  MathSciNet  Google Scholar 

  18. Panneerselvam R (2006) Simple heuristic to minimize total tardiness in a single machine scheduling problem. Int J Adv Manuf Technol 30:722–726. doi:10.1007/s00170-005-0102-1

    Article  Google Scholar 

  19. Resende MGC, Ribeiro CC (2003) Greedy randomized adaptive search procedures. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics. Kluwer, Dordrecht, pp 219–249

    Google Scholar 

  20. Schaller J (2002) Minimizing the sum of squares lateness on a single machine. Eur J Oper Res 143:64–79. doi:10.1016/S0377-2217(01)00322-8

    Article  MATH  MathSciNet  Google Scholar 

  21. Schaller J (2004) Single machine scheduling with early and quadratic tardy penalties. Comput Ind Eng 46:511–532. doi:10.1016/j.cie.2004.01.011

    Article  Google Scholar 

  22. Sen T, Dileepan P, Lind MR (1995) Minimizing a weighted quadratic function of job lateness in the single machine system. Int J Prod Econ 42:237–243. doi:10.1016/0925-5273(95)00201-4

    Article  Google Scholar 

  23. Su LH, Chang PC (1998) A heuristic to minimize a quadratic function of job lateness on a single machine. Int J Prod Econ 55:169–175. doi:10.1016/S0925-5273(98)00041-3

    Article  Google Scholar 

  24. Tsai T-I (2007) A genetic algorithm for solving the single machine earliness/tardiness problem with distinct due dates and ready times. Int J Adv Manuf Technol 31:994–1000. doi:10.1007/s00170-005-0261-0

    Article  Google Scholar 

  25. 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

  26. Valente JMS (2007b) Heuristics for the single machine scheduling problem with early and quadratic tardy penalties. Eur J Ind Eng 1:431–448. doi:10.1504/EJIE.2007.015391

    Article  Google Scholar 

  27. Valente JMS (2008a) An exact approach for the single machine scheduling problem with linear early and quadratic tardy penalties. Asia-Pac J Oper Res 25:169–186. doi:10.1142/S0217595908001730

    Article  MATH  MathSciNet  Google Scholar 

  28. Valente JMS (2008b) Beam search heuristics for quadratic earliness and tardiness scheduling. Working Paper 279. Faculdade de Economia, Universidade do Porto, Portugal (to appear in J Oper Res Soc)

  29. Valente JMS, 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. doi:10.1016/j.cie.2005.01.020

    Article  Google Scholar 

  30. Valente JMS, Alves RAFS (2005b) Improved heuristics for the early/tardy scheduling problem with no idle time. Comput Oper Res 32:557–569. doi:10.1016/j.cor.2003.08.003

    Article  MATH  MathSciNet  Google Scholar 

  31. Valente JMS, Alves RAFS (2005c) Improved lower bounds for the early/tardy scheduling problem with no idle time. J Oper Res Soc 56:604–612. doi:10.1057/palgrave.jors.2601865

    Article  MATH  Google Scholar 

  32. Valente JMS, Alves RAFS (2008) Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties. Comput Oper Res 35:3696–3713. doi:10.1016/j.cor.2007.04.006

    Article  MATH  Google Scholar 

  33. Wagner BJ, Davis DJ, Kher H (2002) The production of several items in a single facility with linearly changing demand rates. Decis Sci 33:317–346. doi:10.1111/j.1540-5915.2002.tb01647.x

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIAAD-INESC Porto L.A., Faculdade de Economia, Universidade do Porto, Rua Dr. Roberto Frias, 4200-464, Porto, Portugal

    Jorge M. S. Valente

  2. EDGE, Faculdade de Economia, Universidade do Porto, Rua Dr. Roberto Frias, 4200-464, Porto, Portugal

    Maria R. A. Moreira

Authors
  1. Jorge M. S. Valente
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maria R. A. Moreira
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jorge M. S. Valente.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Valente, J.M.S., Moreira, M.R.A. Greedy randomised dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties. Int J Adv Manuf Technol 44, 995–1009 (2009). https://doi.org/10.1007/s00170-008-1906-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-008-1906-6

Keywords

Search

Navigation