Skip to main content

Advertisement

SpringerLink
Log in

Genetic algorithms for single machine scheduling with quadratic earliness and tardiness costs

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

Abstract

In this paper, we consider the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. We propose a genetic approach based on a random key alphabet and present several algorithms based on this approach. These versions differ on the generation of both the initial population and the individuals added in the migration step, as well as on the use of local search. The proposed procedures are compared with the best existing heuristics, as well as with optimal solutions for the smaller instance sizes. The computational results show that the proposed algorithms clearly outperform the existing procedures and are quite close to the optimum. The improvement over the existing heuristics increases with both the difficulty and the size of the instances. The performance of the proposed genetic approach is improved by the initialization of the initial population, the generation of greedy randomized solutions, and the addition of the local search procedure. Indeed, the more sophisticated versions can obtain similar or better solutions and are much faster. The genetic version that incorporates all the considered features is the new heuristic of choice for small and medium size 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. 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

    Article  Google Scholar 

  2. Taguchi G (1986) Introduction to quality engineering. Asian Productivity Organization, Tokyo

    Google Scholar 

  3. Sun X, Noble JS, Klein CM (1999) Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness. IIE Trans 31:113–124

    Google Scholar 

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

  5. 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, California

  6. Valente JMS (2007) An exact approach for single machine scheduling with quadratic earliness and tardiness penalties. Working Paper 238, Faculdade de Economia, Universidade do Porto, Portugal

  7. Valente JMS, Alves RAFS (2008) Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties. Comput Oper Res 35:3696–3713

    Article  MATH  MathSciNet  Google Scholar 

  8. Valente JMS (2010) Beam search heuristics for quadratic earliness and tardiness scheduling. J Oper Res Soc 61:620–631

    Article  MATH  Google Scholar 

  9. Valente JMS, Moreira MRA (2009) Greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties. Int J Adv Manuf Technol 44:995–1009

    Article  Google Scholar 

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

    MATH  Google Scholar 

  11. Li G (1997) Single machine earliness and tardiness scheduling. Eur J Oper Res 96:546–558

    Article  MATH  Google Scholar 

  12. Liaw CF (1999) A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. Comput Oper Res 26:679–693

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  14. Ow PS, Morton TE (1989) The single machine early/tardy problem. Manag Sci 35:177–191

    Article  MATH  MathSciNet  Google Scholar 

  15. Valente JMS, Alves RAFS (2005) Improved heuristics for the early/tardy scheduling problem with no idle time. Comput Oper Res 32:557–569

    Article  MATH  MathSciNet  Google Scholar 

  16. Valente JMS, Alves RAFS (2005) Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time. Comput Ind Eng 48:363–375

    Article  Google Scholar 

  17. Gupta SK, Sen T (1983) Minimizing a quadratic function of job lateness on a single machine. Eng Costs Prod Econ 7:187–194

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  20. Schaller J (2002) Minimizing the sum of squares lateness on a single machine. Eur J Oper Res 143:64–79

    Article  MATH  MathSciNet  Google Scholar 

  21. Baker KR, Scudder GD (1990) Sequencing with earliness and tardiness penalties: a review. Oper Res 38:22–36

    Article  MATH  MathSciNet  Google Scholar 

  22. Hoogeveen H (2005) Multicriteria scheduling. Eur J Oper Res 167:592–623

    Article  MATH  MathSciNet  Google Scholar 

  23. Kanet JJ, Sridharan V (2000) Scheduling with inserted idle time: problem taxonomy and literature review. Oper Res 48:99–110

    Article  Google Scholar 

  24. Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, Re-issued in 1992 by MIT Press

    Google Scholar 

  25. Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading

    MATH  Google Scholar 

  26. Reeves CR (1997) Genetic algorithms for the operations researcher. INFORMS J Comput 9:231–250

    Article  MATH  Google Scholar 

  27. Reeves C (2003) Genetic algorithms. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics. Kluwer Academic Publishers, Dordrecht, pp 55–82

    Google Scholar 

  28. Bean JC (1994) Genetics and random keys for sequencing and optimization. ORSA J Comput 6:154–160

    MATH  Google Scholar 

  29. Valente JMS, Gonçalves JF (2009) A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties. Comput Oper Res 36:2707–2715

    Article  MATH  Google Scholar 

  30. Gonçalves JF (2007) A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem. Eur J Oper Res 183:1212–1229

    Article  MATH  Google Scholar 

  31. Gonçalves JF, Mendes JJM, Resende MGC (2005) A hybrid genetic algorithm for the job shop scheduling problem. Eur J Oper Res 167:77–95

    Article  MATH  Google Scholar 

  32. Spears WM, De Jong KA (1991) On the virtues of parameterized uniform crossover. In: Belew R, Booker L (eds) Proceedings of the fourth international conference on genetic algorithms. Morgan Kaufman, San Mateo, pp 230–236

    Google Scholar 

  33. Reeves CR (1995) A genetic algorithm for flowshop sequencing. Comput Oper Res 22:5–13

    Article  MATH  Google Scholar 

  34. Ahuja RK, Orlin JB (1997) Developing fitter GAs. INFORMS J Comput 9:251–253

    Article  Google Scholar 

  35. Ahuja RK, Orlin JB, Tiwari A (2000) A greedy genetic algorithm for the quadratic assignment problem. Comput Oper Res 27:917–934

    Article  MATH  MathSciNet  Google Scholar 

  36. Armony KJC, Luss H, Rosenwein MB (2000) Design of stacked self-healing rings using a genetic algorithm. J Heuristics 6:85–105

    Article  Google Scholar 

  37. Moscato P, Cotta C (2003) A gentle introduction to memetic algotihms. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics. Kluwer Academic Publishers, Dordrecht, pp 105–144

    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

  3. Department of Computer and Information Sciences, University of Hyderabad, P.O. Central University, Hyderabad, 500 046, Andhra Pradesh, India

    Alok Singh

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

    Rui A. F. S. Alves

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

  3. Alok Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Rui A. F. S. Alves
    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., Singh, A. et al. Genetic algorithms for single machine scheduling with quadratic earliness and tardiness costs. Int J Adv Manuf Technol 54, 251–265 (2011). https://doi.org/10.1007/s00170-010-2921-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-010-2921-y

Keywords

Search

Navigation