Skip to main content

Advertisement

SpringerLink
Log in

Scheduling unrelated parallel machines with sequence-dependent setup times

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

Abstract

In this study, the problem of scheduling jobs on unrelated parallel machines with sequence-dependent setup times under due-date constraints is considered to minimize the total cost of tardiness and earliness. A new mathematical model is presented for considered problem and due to the complexity of the problem; an integrated meta-heuristic algorithm is designed to solve the problem. The proposed algorithm consists of genetic algorithm as the basic algorithm and simulated annealing method as local search procedure that follows the genetic algorithm to improve the quality of solutions. The performance of the proposed algorithm is evaluated by solving a set of test problems. The results show that the proposed integrated algorithm is effective.

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. Vallada E, Ruiz R (2011) A genetic algorithm for the unrelated parallel machine scheduling problem with sequence-dependent setup times. Eur J Oper Res 211:612–622

    Article  MathSciNet  Google Scholar 

  2. Allahverdi A, Ng CT, Cheng TCE, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187:985–1032

    Article  MathSciNet  MATH  Google Scholar 

  3. Ying K-C, Li S-W (2012) Unrelated parallel machine scheduling with sequence- and machine-dependent setup times and due date constraints. Int J Innov Comput Inf Control 8:1–19

    MathSciNet  Google Scholar 

  4. Allahverdi A, Gupta JND, Aldowaisan T (1999) A review of scheduling research involving setup considerations. OMEGA Int J Manag Sci 27:219–239

    Article  Google Scholar 

  5. Lin S-W, Chou S-Y, Ying K-C (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 

  6. Arroyo JEC, Ottoni RS, Oliveira AP (2011) Multi-objective variable neighborhood search algorithms for a single machine scheduling problem with distinct due windows. Electron Notes Theor Comput Sci 281:5–19

    Article  Google Scholar 

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

  8. Graham R, Lawler E, Lenstra J, Kan AR (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287–326

    Article  MATH  Google Scholar 

  9. Ullman JD (1975) NP-complete scheduling problem. J Comput Syst Sci 10:384–393

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

  12. Lam K, Xing W (1997) New trends in parallel machine scheduling. Int J Oper Prod Manag 17:326–338

    Article  Google Scholar 

  13. Mokotoff E (2001) Parallel machine scheduling problems: a survey. Asia Pac J Oper Res 18:193–242

    MathSciNet  MATH  Google Scholar 

  14. Lee Y, Pinedo M (1997) Scheduling jobs on parallel machines with sequence-dependent setup times. Eur J Oper Res 100:464–474

    Article  MATH  Google Scholar 

  15. Park Y, Kim S, Lee Y (2000) Scheduling jobs on parallel machines applying neural network and heuristic rules. Comput Ind Eng 38:189–202

    Article  Google Scholar 

  16. Kurz M, Askin R (2001) Heuristic scheduling of parallel machines with sequence-dependent setup times. Int J Prod Res 39:3747–3769

    Article  MATH  Google Scholar 

  17. Fowler JW, Horng SM, Cochran JK (2003) A hybridized genetic algorithm to solve parallel machine scheduling problems with sequence dependent setups. Int J Ind Eng Theory Appl Pract 10:232–243

    Google Scholar 

  18. Kim SS, Shin HJ (2003) Scheduling jobs on parallel machines: a restricted tabu search approach. Int J Adv Manuf Technol 22:278–287

    Article  Google Scholar 

  19. Nessah F, Yalaoui F, Chu C (2005) New heuristics for identical parallel machine scheduling with sequence dependent setup times and dates. In: Proceedings of the International Conference on Industrial Engineering and Systems Management: 32–41

  20. Zhu Z, Heady RB (2000) Minimizing the sum of earliness-tardiness in multi-machine scheduling: a mixed integer programming approach. Comput Ind Eng 38:297–305

    Article  Google Scholar 

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

    Article  Google Scholar 

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

  23. Kim D, Kim K, Jang W, Chen F (2002) Unrelated parallel machine scheduling with setup times using simulated annealing. Robot Comput Integr Manuf 18:223–231

    Article  Google Scholar 

  24. Pereira Lopes MJ, De-Carvalho JMV (2007) A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times. Eur J Oper Res 176:1508–1527

    Article  MATH  Google Scholar 

  25. Chen C-L, Chen C-L (2009) Hybrid meta-heuristics for unrelated parallel machine scheduling with sequence-dependent setup times. Int J Adv Manuf Technol 43:161–169

    Article  Google Scholar 

  26. Lin S-W, Lu C-C, Ying K-C (2011) Minimization of total tardiness on unrelated parallel machines with sequence- and machine-dependent setup times under due date constraints. Int J Adv Manuf 53:353–361

    Article  Google Scholar 

  27. Mitchell M (1999) An introduction to genetic algorithms. MIT Press, Massachusetts

    Google Scholar 

  28. Kirkpatric S, Gelatt JCD, Vecci MP (1983) Optimization by simulated annealing. Science 220:671–680

    Article  MathSciNet  Google Scholar 

  29. Blum C, Roli A (2003) Meta-heuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv 35:268–308

    Article  Google Scholar 

  30. Figielska E (2009) A genetic algorithm and a simulated annealing algorithm combined with column generation technique for solving the problem of scheduling in the hybrid flow-shop with additional resources. Comput Ind Eng 56:142–151

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mazandaran University of Science and Technology, Babol, Iran

    Javad Rezaeian Zeidi & Samir MohammadHosseini

Authors
  1. Javad Rezaeian Zeidi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Samir MohammadHosseini
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Javad Rezaeian Zeidi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zeidi, J.R., MohammadHosseini, S. Scheduling unrelated parallel machines with sequence-dependent setup times. Int J Adv Manuf Technol 81, 1487–1496 (2015). https://doi.org/10.1007/s00170-015-7215-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-015-7215-y

Keywords

Search

Navigation