Solving the Unrelated Parallel Machine Scheduling Problem with Setup Times by Efficient Algorithms Based on Iterated Local Search | SpringerLink
Skip to main content
Springer Nature Link
Log in

Solving the Unrelated Parallel Machine Scheduling Problem with Setup Times by Efficient Algorithms Based on Iterated Local Search

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

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

Included in the following conference series:

Abstract

The Unrelated Parallel Machine Scheduling Problem with Setup Times (UPMSPST) is a problem that belongs to the \(\mathcal {NP}\)-Hard class and it is frequently found in many practical situations, like in textile and chemical industries. The objective in UPMSPST is to schedule jobs in machines in order to achieve the maximum completion time, known as makespan. In an attempt to solve this problem, it is proposed two algorithms: the AIV and the HIVP. Both algorithms are based on Iterated Local Search (ILS) and Variable Neighborhood Descent (VND). The difference between AIV and HIVP is that the first one generates a greedy initial solution, while the second applies a partially greedy procedure to construct the initial solution and it includes the Path Relinking (PR) technique. Neighborhoods based on swaps and multiple insertions are investigated in the developed algorithms. AIV and HIVP were tested on benchmark test problems from literature and statistical analysis of the computational results showed the superiority of them, outperforming the previously best known solutions for UPMSPST.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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

Similar content being viewed by others

References

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

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  3. Karp, R.M.: Reducibility among combinatorial problems. Complex. Comput. Comput. 40, 85–103 (1972)

    Article  MathSciNet  Google Scholar 

  4. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of Np-Completeness., vol. 174. WH Freeman & Co., San Francisco (1979)

    Google Scholar 

  5. Lourenço, H.R., Martin, O., Stützle, T.: Iterated local search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol. 57, pp. 321–353. Kluwer Academic Publishers, Norwell (2003)

    Google Scholar 

  6. Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097–1100 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Souza, M., Coelho, I., Ribas, S., Santos, H., Merschmann, L.: A hybrid heuristic algorithm for the open-pit-mining operational planning problem. Eur. J. Oper. Res. 207, 1041–1051 (2010)

    Article  MATH  Google Scholar 

  8. de Optimización Aplicada, S.: A web site that includes benchmark problem data sets and solutions for scheduling problems (2011). http://soa.iti.es/problem-instances

  9. Weng, M.X., Lu, J., Ren, H.: Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective. Int. J. Prod. Econ. 70, 215–226 (2001)

    Article  Google Scholar 

  10. Kim, D.W., Na, D.G., Chen, F.F.: Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective. Robot. Comput. Integr. Manuf. 19, 173–181 (2003)

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  12. Al-Salem, A.: Scheduling to minimize makespan on unrelated parallel machines with sequence dependent setup times. Eng. J. Univ. Qatar 17, 177–187 (2004)

    Google Scholar 

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

    Article  Google Scholar 

  14. 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, 182–192 (2006)

    MathSciNet  MATH  Google Scholar 

  15. Arnaout, J., 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, 693–701 (2010)

    Article  Google Scholar 

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

    Article  Google Scholar 

  17. Chang, P., Chen, S.: Integrating dominance properties with genetic algorithms for parallel machine scheduling problems with setup times. Appl. Soft Comput. 11, 1263–1274 (2011)

    Article  Google Scholar 

  18. Fleszar, K., Charalambous, C., Hindi, K.: A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times. J. Intell. Manuf. 23, 1949–1958 (2011). doi:10.1007/s10845-011-0522-8

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  20. Resende, M.G.C., Ribeiro, C.C.: GRASP: greedy randomized adaptive search procedures. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies, 2nd edn, pp. 287–312. Springer, New York (2013)

    Google Scholar 

  21. Baker, K.R.: Introduction to Sequencing and Scheduling. John Wiley & Sons, New York (1974)

    Google Scholar 

  22. Bresina, J.L.: Heusistic-biased stochastic sampling. In: Proceedings of the Thirteenth National Conference on Artificial intelligence, vol. 1, pp. 271–278 (1996)

    Google Scholar 

  23. Subramanian, A., Drummond, L., Bentes, C., Ochi, L., Farias, R.: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 37, 1899–1911 (2010)

    Article  MATH  Google Scholar 

  24. Shapiro, S.S., Wilk, M.B.: An analysis of variance test for normality (complete samples). Biometrika 52, 591–611 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  25. Montgomery, D.: Design and Analysis of Experiments, 5th edn. John Wiley & Sons, New York (2007)

    Google Scholar 

Download references

Acknowledgements

The authors thank the Brazilian agencies FAPEMIG and CNPq, and the Universidade Federal de Ouro Preto (UFOP) for the financial support on the development of this work.

Author information

Authors and Affiliations

  1. Departamento de Computação, Universidade Federal de Ouro Preto, Ouro Preto, MG, 35.400-000, Brazil

    Matheus N. Haddad, Luciano P. Cota & Marcone J. F. Souza

  2. Programa de Engenharia de Sistemas e Computação, Universidade Federal Do Rio de Janeiro, Rio de Janeiro, RJ, 21941-972, Brazil

    Nelson Maculan

Authors
  1. Matheus N. Haddad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luciano P. Cota
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marcone J. F. Souza
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Nelson Maculan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Matheus N. Haddad .

Editor information

Editors and Affiliations

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

    José Cordeiro

  2. MODESTE/ESEO, Angers, France

    Slimane Hammoudi

  3. Wroclaw University of Economics, Wroclaw, Poland

    Leszek Maciaszek

  4. MODESTE/ESEO, Angers, France

    Olivier Camp

  5. INSTICC, Polytechnic Institute of Setúbal, Setúbal, Portugal

    Joaquim Filipe

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Haddad, M.N., Cota, L.P., Souza, M.J.F., Maculan, N. (2015). Solving the Unrelated Parallel Machine Scheduling Problem with Setup Times by Efficient Algorithms Based on Iterated Local Search. In: Cordeiro, J., Hammoudi, S., Maciaszek, L., Camp, O., Filipe, J. (eds) Enterprise Information Systems. ICEIS 2014. Lecture Notes in Business Information Processing, vol 227. Springer, Cham. https://doi.org/10.1007/978-3-319-22348-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-22348-3_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-22347-6

  • Online ISBN: 978-3-319-22348-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation