Skip to main content
SpringerLink
Log in

Algorithms for the single machine total weighted completion time scheduling problem with release times and sequence-dependent setups

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

Abstract

This paper considers the problem of scheduling n jobs on a single machine to minimize the total weighted completion time in the presence of sequence-dependent setup times and release times. To the best of our knowledge, little research has been devoted to this scheduling problem. Therefore, we developed two exact algorithms, including a constraint programming model and a branch-and-bound method for small problems. The obtained optimal solutions can be used as a benchmark for evaluating the performance of heuristics. With the complexity in mind, two heuristics, including a best index dispatch (BID) and a modified weighted shortest processing time (MWSPT) based on non-delay concepts are also proposed for large problems. The time complexities of the two proposed heuristics are O(n 4) and O(n 3), respectively. The computational results showed that the branch-and-bound method could solve most instances with 40 jobs under the time limit of 7,200 s. The BID heuristic is superior to the MWSPT in solution quality, although both can efficiently and effectively obtain near-optimal solutions for large 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. Bianco L, Ricciardelli S, Rinaldi G, Sassano A (1988) Scheduling tasks with sequence-dependent processing times. Nav Res Logist 35:177–184. doi:10.1002/1520-6750(198804)35:2<177::AID-NAV3220350203>3.0.CO;2-V

    Article  MATH  MathSciNet  Google Scholar 

  2. Ozgur C, Brown J (1995) A two-stage traveling salesman procedure for the single machine sequence-dependent scheduling problem. Omega 23:205–219. doi:10.1016/0305-0483(94)00057-H

    Article  Google Scholar 

  3. Bowers MR, Groom K, Ng WM, Zhang G (1995) Cluster analysis to minimize sequence dependent changeover times. Math Comput Model 21:89–95. doi:10.1016/0895-7177(95)00083-E

    Article  MATH  Google Scholar 

  4. Gajpal Y, Rajendran C, Ziegler H (2006) An ant colony algorithm for scheduling in flowshops with sequence-dependent setup times of jobs. Int J Adv Manuf Technol 30:416–424. doi:10.1007/s00170-005-0093-y

    Article  Google Scholar 

  5. Barnes JW, Vanston LK (1981) Scheduling jobs with linear delay penalties and sequence dependent setup costs. Oper Res 40:146–160

    Article  MathSciNet  Google Scholar 

  6. Feo TA, Sarathy K, McGahan J (1996) A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties. Comput Oper Res 23:881–895. doi:10.1016/0305-0548(95)00084-4

    Article  MATH  Google Scholar 

  7. Rabadi G, Anagnostopoulos GC, Mollaghasemi M (2007) 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. doi:10.1007/s00170-005-0333-1

    Article  Google Scholar 

  8. Shin HJ, Kim C-O, Kim SS (2002) A tabu search algorithm for single machine scheduling with release times, due dates, and sequence-dependent set-up times. Int J Adv Manuf Technol 19:859–866. doi:10.1007/s001700200097

    Article  Google Scholar 

  9. Liao C-J, Juan H-C (2007) An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups. Comput Oper Res 34:1899–1909. doi:10.1016/j.cor.2005.07.020

    Article  MATH  Google Scholar 

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

  11. Anghinolfi D, Paolucci M A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times. Eur J Oper Res. doi:10.1016/j.ejor.2007.10.044

  12. Cicirello VA (2003) Weighted tardiness scheduling with sequence-dependent setups: a benchmark library. Intelligent Coordination and Logistics Laboratory, Robotics Institute, Carnegie Mellon University, USA, Technical Report

  13. Gupta SR, Smith JS (2006) Algorithms for single machine total tardiness scheduling with sequence dependent setups. Eur J Oper Res 175:722–739. doi:10.1016/j.ejor.2005.05.018

    Article  MATH  Google Scholar 

  14. Luo X, Chu F (2006) A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness. Appl Math Comput 183(1):575–588. doi:10.1016/j.amc.2006.05.127

    Article  MATH  MathSciNet  Google Scholar 

  15. Tan KC, Narasinmhan 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:313–326. doi:10.1016/S0305-0483(99)00050-X

    Article  Google Scholar 

  16. Tan KC, Narasimhan R (1997) Minimizing tardiness on a single processor with sequence-dependent times: a simulated annealing approach. Omega 25:619–634. doi:10.1016/S0305-0483(97)00024-8

    Article  Google Scholar 

  17. Rubin PA, Ragatz GL (1995) Scheduling in a sequence dependent setup environment with generic search. Comput Oper Res 22(1):85–99. doi:10.1016/0305-0548(93)E0021-K

    Article  MATH  Google Scholar 

  18. Bianco L, Mingozzi A, Ricciardelli S (1993) The traveling salesman problem with cumulative costs. Networks 23:81–91. doi:10.1002/net.3230230202

    Article  MATH  MathSciNet  Google Scholar 

  19. Rinnooy Kan AHG (1976) Machine scheduling problems: classification, complexity and computations. Martinus Nijhoff, The Hague

    Google Scholar 

  20. Bianco L, Dell’Olmo P, Giordani S (1999) Minimizing total completion time subject to release dates and sequence-dependent processing time. Ann Oper Res 86:393–415. doi:10.1023/A:1018975323093

    Article  MATH  MathSciNet  Google Scholar 

  21. Smith WE (1956) Various optimizers for single-stage production. Nav Res Logist 3:59–66. doi:10.1002/nav.3800030106

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering and Management, Ching Yun University, Jung-Li, Tao Yuan, Taiwan, 320, Republic of China

    Fuh-Der Chou & Tzu-Yun Chang

  2. Department of Industrial Management, Vanung University, Jung-Li, Tao Yuan, Taiwan, 320, Republic of China

    Hui-Mei Wang

Authors
  1. Fuh-Der Chou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hui-Mei Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tzu-Yun Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fuh-Der Chou.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chou, FD., Wang, HM. & Chang, TY. Algorithms for the single machine total weighted completion time scheduling problem with release times and sequence-dependent setups. Int J Adv Manuf Technol 43, 810–821 (2009). https://doi.org/10.1007/s00170-008-1762-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-008-1762-4

Keywords

Search

Navigation