Skip to main content

Efficient metaheuristic algorithm and re-formulations for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times

Abstract

In this paper, an unrelated parallel machine scheduling problem with sequence and machine-dependent setup times and makespan minimization is studied. A new makespan linearization and several mixed integer formulations are proposed for this problem. These formulations outperform the previously published formulations regarding size of instances and computational time to reach optimal solutions. Using these models, it is possible to solve instances six times larger than what was previously solved and to obtain optimal solutions on instances of the same size up to four orders of magnitude faster. A metaheuristic algorithm based on multi-start algorithm and variable neighbourhood descent metaheuristic is proposed. Composite movements were defined for the improvement phase of the proposed metaheuristic algorithm that considerably improved the performance of the algorithm providing small deviations from optimal solutions in medium-sized instances and outperforming the best known solutions for large instances.

This is a preview of subscription content, access via your institution.

References

  1. Allahverdi A (2000) Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times. Comput Oper Res 27(2):111–127

    Article  MATH  MathSciNet  Google Scholar 

  2. Arnaout J, Rabadi G, Musa R (2010) A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. J Intell Manuf 21(6):693–701

    Article  Google Scholar 

  3. Balin S (2012) Non-identical parallel machine scheduling with fuzzy processing times using robust genetic algorithm and simulation. Int J Innov Comput Inf Control 8(1 B):727–745

    Google Scholar 

  4. 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(11–12):1204–1212

    Article  Google Scholar 

  5. Cheng T, Ding Q, Lin B (2004) A concise survey of scheduling with time-dependent processing times. Eur J Oper Res 152(1):1–13

    Article  MATH  MathSciNet  Google Scholar 

  6. De P, Morton T (1980) Scheduling to minimize makespan on unequal parallel processors. Decis Sci 11(4):586–602

    Article  Google Scholar 

  7. Fleszar K, Charalambous C, Hindi K (2012) A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times. J Intell Manuf 23(5):1949–1958

    Article  Google Scholar 

  8. Garey R, Johnson D (1979) Computers and intractability: a guide to the theory of NP-completeness. Series of Books in the Mathematical Sciences. W. H. Freeman

  9. Hansen P, Mladenović N, Pérez JAM (2010) Variable neighbourhood search: methods and applications. Ann Oper Res 175(1):367–407

    Article  MATH  MathSciNet  Google Scholar 

  10. 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(3):182–192

    MATH  MathSciNet  Google Scholar 

  11. Lee JH, Yu JM, Lee DH (2013) A tabu search algorithm for unrelated parallel machine scheduling with sequence-and machine-dependent setups: minimizing total tardiness. Int J Adv Manuf Technol:1–9

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

    Article  MATH  Google Scholar 

  13. Lin SW, Lu CC, Ying KC (2011) 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(1–4):353–361

    Article  Google Scholar 

  14. Lin YK (2013) Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates. Math Probl Eng. doi:10.1155/2013/409486

  15. Lin YK, Hsieh FY (2014) Unrelated parallel machine scheduling with setup times and ready times. Int J Prod Res 52(4):1200–1214

    Article  Google Scholar 

  16. Martí R, Moreno-Vega JM, Duarte A (2010) Advanced multi-start methods. In: Gendreau M, Potvin J Y (eds) Handbook of Metaheuristics, vol 146. Springer, pp 265–281

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

    MATH  MathSciNet  Google Scholar 

  18. Or I (1976) Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. PhD thesis. Northwestern University, Evanston

    Google Scholar 

  19. Rabadi G, Moraga R, Al-Salem A (2006) Heuristics for the unrelated parallel machine scheduling problem with setup times. J Intell Manuf 17(1):85–97

    Article  Google Scholar 

  20. Rocha P, Ravetti M, Mateus G, Pardalos P (2008) Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times. Comput Oper Res 35(4):1250–1264

    Article  MATH  MathSciNet  Google Scholar 

  21. Tian K, Jiang Y, Shen X, Mao W (2010) Makespan minimization for job co-scheduling on chip multiprocessors. Tech. Rep. WM-CS-2010-08, Department of Computer Science, College of William & Mary

  22. Tran T, Beck J (2012) Logic-based benders decomposition for alternative resource scheduling with sequence dependent setups. In: 20th European Conference on Artificial Intelligence, pp 774–780

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

  24. Yang-Kuei L, Chi-Wei L (2013) Dispatching rules for unrelated parallel machine scheduling with release dates. Int J Adv Manuf Technol 67(1–4):269–279

    Article  Google Scholar 

  25. Ying K, Lee Z, Lin S (2012) Makespan minimization for scheduling unrelated parallel machines with setup times. J Intell Manuf 23(5):1795–1803

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Francisco Angel-Bello.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Avalos-Rosales, O., Angel-Bello, F. & Alvarez, A. Efficient metaheuristic algorithm and re-formulations for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times. Int J Adv Manuf Technol 76, 1705–1718 (2015). https://doi.org/10.1007/s00170-014-6390-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-014-6390-6

Keywords

  • Scheduling
  • Unrelated parallel machines
  • Dependent setup times
  • Makespan
  • Multi-start
  • VND