Skip to main content
SpringerLink
Log in

A Hybrid Algorithm for the Unrelated Parallel Machine Scheduling Problem

  • Conference paper
  • First Online:
Enterprise Information Systems (ICEIS 2019)

Part of the book series: Lecture Notes in Business Information Processing ((LNBIP,volume 378))

Included in the following conference series:

  • 790 Accesses

Abstract

This work proposes a hybrid algorithm for the unrelated parallel machine scheduling problem with sequence-dependent setup times, aiming to minimize the makespan. The proposed algorithm, named Enhanced Smart General Variable Neighborhood Search (e-SGVNS), combines heuristic and exact optimization strategies to explore the solution space of the problem. The exact strategy works like a local search and consists of applying a mathematical programming formulation based on the time-dependent traveling salesman problem to obtain the optimal solution to the sequencing problem on each machine. In turn, the heuristic strategy explores neighborhoods based on swap and insertion moves. The computational results, performed in benchmark instances from literature, showed that e-SGVNS is competitive when compared to state-of-the-art algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://www.cpubenchmark.net/compare/Intel-i7-870-vs-Intel-Pentium-4-3.00GHz/832vs1074.

References

  1. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, vol. 40, pp. 85–103. Springer, Boston (1972). https://doi.org/10.1007/978-1-4684-2001-2_9

    Chapter  Google Scholar 

  2. Lopes, M.J.P., de Carvalho, J.V.: A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times. Eur. J. Oper. Res. 176(3), 1508–1527 (2007)

    Article  MathSciNet  Google Scholar 

  3. Avalos-Rosales, O., Alvarez, A.M., Angel-Bello, F.: A reformulation for the problem of scheduling unrelated parallel machines with sequence and machine dependent setup times. In: Proceedings of the 23rd International Conference on Automated Planning and Scheduling - ICAPS, Rome, Italy, pp. 278–283 (2013)

    Google Scholar 

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

    Article  Google Scholar 

  5. Tran, T.T., Araujo, A., Beck, J.C.: Decomposition methods for the parallel machine scheduling problem with setups. INFORMS J. Comput. 28(1), 83–95 (2016)

    Article  MathSciNet  Google Scholar 

  6. Rego., M.F., Souza, M.: Smart general variable neighborhood search with local search based on mathematical programming for solving the unrelated parallel machine scheduling problem. In: Proceedings of the 21st International Conference on Enterprise Information Systems - Volume 1: ICEIS, INSTICC, pp. 287–295. SciTePress (2019)

    Google Scholar 

  7. Mladenović, N., Dražić, M., Kovačevic-Vujčić, V., Čangalović, M.: General variable neighborhood search for the continuous optimization. Eur. J. Oper. Res. 191(3), 753–770 (2008)

    Article  MathSciNet  Google Scholar 

  8. Santos, H.G., Toffolo, T.A., Silva, C.L., Vanden Berghe, G.: Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem. Int. Trans. Oper. Res. 26(2), 707–724 (2019)

    Article  MathSciNet  Google Scholar 

  9. Arnaout, J.P.: A worm optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. Ann. Oper. Res. 285, 273–293 (2019)

    Article  MathSciNet  Google Scholar 

  10. Arnaout, J.P., Musa, R., Rabadi, G.: A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines - part II: enhancements and experimentations. J. Intell. Manuf. 25(1), 43–53 (2014)

    Article  Google Scholar 

  11. Arnaout, J.P., Rabadi, G., Musa, R.: 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 (2010)

    Article  Google Scholar 

  12. Cota, L.P., Guimarães, F.G., de Oliveira, F.B., Souza, M.J.F.: An adaptive large neighborhood search with learning automata for the unrelated parallel machine scheduling problem. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 185–192. IEEE (2017)

    Google Scholar 

  13. Fanjul-Peyro, L., Ruiz, R.: Iterated greedy local search methods for unrelated parallel machine scheduling. Eur. J. Oper. Res. 207(1), 55–69 (2010)

    Article  MathSciNet  Google Scholar 

  14. Mokotoff, E., Jimeno, J.: Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem. Ann. Oper. Res. 117(1), 133–150 (2002)

    Article  MathSciNet  Google Scholar 

  15. Ghirardi, M., Potts, C.N.: Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach. Eur. J. Oper. Res. 165(2), 457–467 (2005)

    Article  Google Scholar 

  16. Vallada, E., Ruiz, R.: A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times. Eur. J. Oper. Res. 211(3), 612–622 (2011)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  19. Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)

    Article  MathSciNet  Google Scholar 

  20. Bigras, L.P., Gamache, M., Savard, G.: The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times. Discrete Optim. 5(4), 685–699 (2008)

    Article  MathSciNet  Google Scholar 

  21. LLC Gurobi Optimization: Gurobi optimizer reference manual (2018). http://www.gurobi.com

  22. López-Ibáñez, M., Dubois-Lacoste, J., Pérez Cáceres, L., Stützle, T., Birattari, M.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43–58 (2016)

    Article  MathSciNet  Google Scholar 

  23. PassMark: CPU benchmarks (2018). https://www.cpubenchmark.net/. Accessed 12 Feb 2018

  24. Helal, M., Rabadi, G., Al-Salem, A.: 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 (2006)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

The authors gratefully thank Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) - Finance Code 001, Fundação de Amparo à Pesquisa do Estado de Minas Gerais (FAPEMIG, grant PPM/CEX/FAPEMIG/676-17), Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq, grant 307915/2016-6), Universidade Federal de Ouro Preto (UFOP) and Universidade Federal dos Vales do Jequitinhonha e Mucuri (UFVJM) for supporting this research. The authors also thank the anonymous reviewers for their valuable comments.

Author information

Authors and Affiliations

  1. Programa de Pós-Graduação em Ciência da Computação, Universidade Federal de Ouro Preto (UFOP), Ouro Preto, Minas Gerais, 35.400-000, Brazil

    Marcelo Ferreira Rego & Marcone Jamilson Freitas Souza

  2. Universidade Federal dos Vales do Jequitinhonha e Mucuri (UFVJM), Diamantina, 39.100-000, Brazil

    Marcelo Ferreira Rego

Authors
  1. Marcelo Ferreira Rego
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcone Jamilson Freitas Souza
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marcelo Ferreira Rego .

Editor information

Editors and Affiliations

  1. INSTICC and Polytechnic Institute of Setúbal, Setúbal, Portugal

    Joaquim Filipe

  2. Warsaw University of Technology, Warsaw, Poland

    Michał Śmiałek

  3. George Mason University, Fairfax, VA, USA

    Alexander Brodsky

  4. MODESTE/ESEO, Angers, France

    Slimane Hammoudi

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Rego, M.F., Souza, M.J.F. (2020). A Hybrid Algorithm for the Unrelated Parallel Machine Scheduling Problem. In: Filipe, J., Śmiałek, M., Brodsky, A., Hammoudi, S. (eds) Enterprise Information Systems. ICEIS 2019. Lecture Notes in Business Information Processing, vol 378. Springer, Cham. https://doi.org/10.1007/978-3-030-40783-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-40783-4_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-40782-7

  • Online ISBN: 978-3-030-40783-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation