Skip to main content
SpringerLink
Log in

Minimization of total tardiness on unrelated parallel machines with sequence- and machine-dependent setup times under due date constraints

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

Abstract

The unrelated parallel machine scheduling problem with sequence- and machine-dependent setup times in the presence of due date constraints represents an important but relatively less-studied scheduling problem in the literature. In this study, a simple iterated greedy (IG) heuristic is presented to minimize the total tardiness of this scheduling problem. The effectiveness and efficiency of the proposed IG heuristic are compared with existing algorithms on a benchmark problem dataset used in earlier studies. Extensive computational results indicate that the proposed IG heuristic is capable of obtaining significantly better solutions than the state-of-the-art algorithms on the same benchmark problem dataset with similar computational resources.

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.

Similar content being viewed by others

References

  1. Ying KC, Lin SW (2007) Multi-heuristic desirability ant colony system heuristic for non-permutation flowshop scheduling problems. Int J Adv Manuf Technol 33:793–802

    Article  Google Scholar 

  2. McNaughton R (1959) Scheduling with deadlines and loss functions. Manage Sci 6:1–12

    Article  MathSciNet  MATH  Google Scholar 

  3. Lee ZJ, Lin SW, Ying KC (2009) Scheduling jobs on dynamic parallel machines with sequence-dependent setup times. Int J Adv Manuf Technol. doi:10.1007/s00170-009-2203-8

    Google Scholar 

  4. Cheng TCE, Sin CCS (1990) A state-of-the-art review of parallel-machine scheduling research. Eur J Oper Res 47:271–292

    Article  MATH  Google Scholar 

  5. Chen JF (2005) Unrelated parallel machine scheduling with secondary resource constraints. Int J Adv Manuf Technol 26:285–292

    Article  Google Scholar 

  6. Pfund M, Fowler JW, Gupta JND (2004) A survey of algorithms for single and multi-objective unrelated parallel-machine deterministic scheduling problems. J Chin Inst Ind Eng 21:230–241

    Article  Google Scholar 

  7. Lin SW, Chou SY, Ying KC (2007) A sequential exchange approach for minimizing earliness–tardiness penalties of single-machine scheduling with a common due date. Eur J Oper Res 177:1294–1301

    Article  MATH  Google Scholar 

  8. Lin SW, Ying KC (2007) Solving single machine total weighted tardiness problems with sequence-dependent setup times by meta-heuristics. Int J Adv Manuf Technol 34:1183–1190

    Article  Google Scholar 

  9. Lancia G (2000) Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan. Eur J Oper Res 120:277–288

    Article  MathSciNet  MATH  Google Scholar 

  10. Liaw CF, Lin YK, Chen CY, Chen M (2003) Scheduling unrelated parallel machines to minimize total weighted tardiness. Comput Oper Res 30:1777–1789

    Article  MathSciNet  MATH  Google Scholar 

  11. Helal M, Rabadi G, Al-Salem A (2006) A Tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times. Int J Oper Res 3:182–192

    MathSciNet  MATH  Google Scholar 

  12. Shim SO, Kim YD (2007) Minimizing total tardiness in an unrelated parallel-machine scheduling problem. J Oper Res Soc 58:346–354

    Article  MATH  Google Scholar 

  13. Rocha PL, Ravetti MG, Mateus GR, Pardalos PM (2008) Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times. Comput Oper Res 35:1250–1264

    Article  MathSciNet  MATH  Google Scholar 

  14. Ying KC, Lin SW, Lee ZJ (2009) Hybrid-directional planning: improving improvement heuristics for scheduling resource-constrained projects. Int J Adv Manuf Technol 41:358–366

    Article  Google Scholar 

  15. Suresh V, Chaudhuri D (1994) Minimizing maximum tardiness for unrelated parallel machines. Int J Prod Econ 34:223–229

    Article  Google Scholar 

  16. Adamopoulos GI, Pappis CP (1998) Scheduling under a common due-date on parallel unrelated machines. Eur J Oper Res 105:494–501

    Article  MATH  Google Scholar 

  17. Kim DW, Kim KH, Jang W, Chen FF (2002) Unrelated parallel machine scheduling with setup times using simulated annealing. Robot Comput-Integr Manuf 18:223–231

    Article  Google Scholar 

  18. Kim DW, Na DG, Chen FF (2003) Unrelated parallel machine scheduling with setup times and total weighted tardiness objective. Robot Comput-Integr Manuf 19:173–181

    Article  Google Scholar 

  19. Chen JF (2006) Minimization of maximum tardiness on unrelated parallel machines with process restrictions and setups. Int J Adv Manuf Technol 29:557–563

    Google Scholar 

  20. Logendran R, Subur F (2004) Unrelated parallel machine scheduling with job splitting. IIE Trans 36:359–371

    Article  Google Scholar 

  21. Logendrana R, McDonellb B, Smucker B (2007) Scheduling unrelated parallel machines with sequence-dependent setups. Comput Oper Res 34:3420–3438

    Article  MathSciNet  Google Scholar 

  22. Zhang Z, Zheng L, Weng MX (2007) Dynamic parallel machine scheduling with mean weighted tardiness objective by Q-Learning. Int J Adv Manuf Technol 34:968–980

    Article  Google Scholar 

  23. Chen JF (2009) Scheduling on unrelated parallel machines with sequence- and machine-dependent setup times and due-date constraints. Int J Adv Manuf Technol 44:1204–1212

    Article  Google Scholar 

  24. Chen CL, Chen CL (2009) Hybrid metaheuristics for unrelated parallel machine scheduling with sequence-dependent setup times. Int J Adv Manuf Technol 43:161–169

    Article  Google Scholar 

  25. Pinedo M (2008) Scheduling, theory, algorithms, and systems, 3rd edn. Prentice Hall, New York

  26. Koulamas C (1994) The total tardiness problem review and extensions. Oper Res 142:764–775

    MathSciNet  Google Scholar 

  27. Jacobs LW, Brusco MJ (1995) A local-search heuristic for large set-covering problems. Nav Res Logist 42:1129–1140

    Article  MathSciNet  MATH  Google Scholar 

  28. Marchiori E, Steenbeek A (2000) An evolutionary algorithm for large scale set covering problems with application to airline crew scheduling. Lect Notes Comput Sci 1803:367–381

    Google Scholar 

  29. Ruiz R, Stützle T (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 177:2033–2049

    Article  MATH  Google Scholar 

  30. Baraz D, Mosheiov G (2008) A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time. Eur J Oper Res 184:810–813

    Article  MathSciNet  MATH  Google Scholar 

  31. Ruiz R, Stützle T (2008) An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. Eur J Oper Res 187:1143–1159

    Article  MATH  Google Scholar 

  32. Ying KC (2008) Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic. Int J Adv Manuf Technol 38:348–354

    Article  Google Scholar 

  33. Ying KC (2009) An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks. J Oper Res Soc 60:810–817

    Article  MATH  Google Scholar 

  34. Ying KC, Lin SW, Huang CY (2009) Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic. Expert Syst Appl 36:7087–7092

    Article  Google Scholar 

  35. Ying KC, Cheng HM (2010) Dynamic parallel machine scheduling with sequence-dependent setup times using an iterated greedy heuristic. Expert Syst Appl 37:2848–2852

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Management, Chang Gung University, Taoyuan, Taiwan

    Shih-Wei Lin

  2. Graduate Institute of Information and Logistics Management, National Taipei University of Technology, Taipei, Taiwan

    Chung-Cheng Lu

  3. Department of Industrial Engineering and Management, National Taipei University of Technology, Taipei, Taiwan

    Kuo-Ching Ying

Authors
  1. Shih-Wei Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chung-Cheng Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kuo-Ching Ying
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kuo-Ching Ying.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lin, SW., Lu, CC. & Ying, KC. Minimization of total tardiness on unrelated parallel machines with sequence- and machine-dependent setup times under due date constraints. Int J Adv Manuf Technol 53, 353–361 (2011). https://doi.org/10.1007/s00170-010-2824-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation