Skip to main content
SpringerLink
Log in

A heuristic algorithm for the just-in-time single machine scheduling problem with setups: a comparison with simulated annealing

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

Abstract

This paper addresses the single machine early/tardy problem with unrestricted common due date and sequence-dependent setup times. Two algorithms are introduced to reach near-optimum solutions: the SAPT, a heuristic tailored for the problem, and a simulated annealing (SA) algorithm. It will be shown that SA provides solutions with slightly better quality; however, SAPT requires much less computational time. SAPT-SA is a hybrid heuristic that combines both approaches to obtain high quality solutions with low computational cost. Solutions provided by the three algorithms were compared to optimal solutions for problems with up to 25 jobs and to each other for larger problems.

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. Kanet JJ (1981) Minimizing the average deviation of job completion times about a common due date. Nav Res Logist 28:643–651

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. Hall NG (1986) Single- and multiple-processor models for minimizing completion time variance. Nav Res Logist Q 33:49–54

    MATH  Google Scholar 

  4. Bagchi U, Sullivan R, Chang Y-L (1986) Minimizing mean absolute deviation of completion times about a common due date. Nav Res Logist Q 33:227–240

    MATH  MathSciNet  Google Scholar 

  5. Szwarc W (1989) Single machine scheduling to minimize absolute deviation of completion times from a common due date. Nav Res Logist 36:663–673

    MATH  MathSciNet  Google Scholar 

  6. Hall NG, Posner ME (1991) Earliness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date. Oper Res 39(5):836–846

    MATH  MathSciNet  Google Scholar 

  7. Alidaee B, Dragan I (1997) A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: a case of small common due date. Eur J Oper Res 96:559–563

    Article  MATH  Google Scholar 

  8. Azizoglu M, Webster S (1997) Scheduling job families about an unrestricted common due date on a single machine. Int J Prod Res 35(5):1321–1330

    Article  MATH  Google Scholar 

  9. Mondal SA, Sen AK (2001) Single machine weighted earliness-tardiness penalty problem with a common due date. Comput Oper Res 28(7):649–669

    Article  MATH  Google Scholar 

  10. Sundararaghavan P, Ahmed M (1984) Minimizing the sum of absolute lateness in single-machine and multimachine scheduling. Nav Res Logist Q 31:325–333

    MATH  Google Scholar 

  11. Liman SD, Lee C-Y (1993) Error bound of a heuristic for the common due date scheduling problem. ORSA J Comput 5(4):420–425

    MATH  Google Scholar 

  12. Lee C-Y, Choi JY (1995) A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights. Comput Oper Res 22(8):857–869

    Article  MATH  MathSciNet  Google Scholar 

  13. Sirdharan V, Zhou Z (1996) A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problem. Eur J Oper Res 94:292–301

    Article  Google Scholar 

  14. James RJW (1997) Using tabu search to solve the common due date early/tardy machine scheduling problem. Comput Oper Res 24(3):199–208

    Article  MATH  MathSciNet  Google Scholar 

  15. Webster S, Jog D, Gupta A (1998) A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date. Int J Prod Res 36:2543–2551

    Article  MATH  Google Scholar 

  16. Allahverdi A, Gupta JND, Aldowaisan T (1999) A review of scheduling research involving setup consideration. Omega 27(2):219–239

    Article  Google Scholar 

  17. Coleman BJ (1992) A simple model for optimizing the single machine early/tardy problem with sequence-dependent setups. Prod Oper Manag 1:225–228

    Google Scholar 

  18. Rabadi G (2004) A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time. Comput Oper Res 31(10):1727–1751

    Article  MATH  Google Scholar 

  19. Metropolis N, Rosenbluth A, Rosenbluth M, Teller A, Teller E (1953) Equations of state calculations by fast computing machines. J Chem Phys 21(6):1087–1092

    Article  Google Scholar 

  20. Kirkpatrick S, Gelatt CD Jr, Vecchi M (1983) Optimization by simulated annealing. Science 220:671–690

    Article  MathSciNet  Google Scholar 

  21. Shapiro JA, Alfa AS (1995) An experimental analysis of the simulated annealing algorithm for a single-machine scheduling problem. Eng Optim 24(2):79–100

    Google Scholar 

  22. Glover F (1989) Tabu search-part I. ORSA J Comput 1:190–206

    MATH  MathSciNet  Google Scholar 

  23. Glover F (1990) Tabu search-part II. ORSA J Comput 2:4–32

    MATH  Google Scholar 

  24. Tan KC, Narasimhan R (1997) Minimizing tardiness on a single processor with sequence-dependent setup times: a simulated annealing approach. Omega 25(6):619–634

    Article  Google Scholar 

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

    Article  Google Scholar 

  26. Tan KC, Narasimhan R, Rubin PA, Ragatz GL (2000) A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times. Omega 28(3):313–326

    Article  Google Scholar 

  27. Mittenthal J, Raghavachari M, Rana AI (1993) A hybrid simulated annealing approach for single-machine scheduling problems with non-regular penalty functions. Comput Oper Res 20(2):103–111

    Article  MATH  Google Scholar 

  28. Adenso-Diaz B (1996) An SA/TS mixture algorithm for the scheduling tardiness problem. Eur J Oper Res 88:516–524

    Article  MATH  Google Scholar 

  29. Almeida MT, Centeno M (1998) A composite heuristic for the single machine early/tardy job scheduling problem. Comput Oper Res 25(7–8):625–635

    Article  MATH  Google Scholar 

  30. Gendreau M, Laporte L, Guimaraes EM (2001) A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times. Eur J Oper Res 133:183–189

    Article  MATH  MathSciNet  Google Scholar 

  31. Morton T, Pentico D (1993) Heuristic scheduling systems: with applications to production systems and project management. Wiley, New York

    Google Scholar 

  32. Scheduling Research (2005) http://www.SchedulingResearch.com

Download references

Author information

Authors and Affiliations

  1. Engineering Management and Systems Engineering Department, Old Dominion University, 241 Kaufman Hall, Norfolk, VA, 23529, USA

    Ghaith Rabadi

  2. Department of Electrical & Computer Engineering, Florida Institute of Technology, Melbourne, FL, 32901-6975, USA

    Georgios C. Anagnostopoulos

  3. Industrial Engineering and Management Systems Department, University of Central Florida, Orlando, FL, 32816, USA

    Mansooreh Mollaghasemi

Authors
  1. Ghaith Rabadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Georgios C. Anagnostopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mansooreh Mollaghasemi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ghaith Rabadi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rabadi, G., Anagnostopoulos, G.C. & Mollaghasemi, M. A heuristic algorithm for the just-in-time single machine scheduling problem with setups: a comparison with simulated annealing. Int J Adv Manuf Technol 32, 326–335 (2007). https://doi.org/10.1007/s00170-005-0333-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-005-0333-1

Keywords

Search

Navigation