Skip to main content
Springer Nature Link
Log in

Application of the Simulated Annealing Algorithm to Minimize the makespan on the Unrelated Parallel Machine Scheduling Problem with Setup Times

  • Conference paper
  • First Online:
Hybrid Intelligent Systems (HIS 2018)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 923))

Included in the following conference series:

Abstract

In this paper, the unrelated parallel machine scheduling problem considering machine-dependent and job sequence-dependent setup times is addressed. This problem involves the scheduling of n jobs on m unrelated machines with setup times in order to minimize the makespan. The Simulated Annealing algorithm is used to solve four sets of small scheduling problems, from the literature, on two unrelated machines: the first one has six jobs, the second has seven jobs and the third and fourth has eight and nine jobs, respectively. The results seem promising when compared with other methods referred in literature.

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
$34.99 /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
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

Similar content being viewed by others

References

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

  2. Varela, M.L.R., Aparício, J.N., Silva, S.C.: A web-based application for manufacturing scheduling. In: IASTED International Conference on Intelligent Systems and Control, pp. 400–405 (2003)

    Google Scholar 

  3. Reddy, M.S., Ratnam, C., Agrawal, R., Varela, M.L.R., Sharma, I., Manupati, V.K.: Investigation of reconfiguration effect on makespan with social network method for flexible job shop scheduling problem. Comput. Ind. Eng. 110, 231–241 (2017)

    Article  Google Scholar 

  4. Ghadiri Nejad, M., Güden, H., Vizvári, B., Vatankhah Barenji, R.: A mathematical model and simulated annealing algorithm for solving the cyclic scheduling problem of a flexible robotic cell. Adv. Mech. Eng. 10(1), 1–12 (2018)

    Article  Google Scholar 

  5. Hinder, O., Mason, A.J.: A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness. Eur. J. Oper. Res. 262(2), 411–423 (2017)

    Article  MathSciNet  Google Scholar 

  6. Nikabadi, M., Naderi, R.: A hybrid algorithm for unrelated parallel machines scheduling. Int. J. Ind. Eng. Comput. 7(4), 681–702 (2016)

    Google Scholar 

  7. Rewers, P., Trojanowska, J., Diakun, J., Rocha, A., Reis, L.P.: A study of priority rules for a levelled production plan. In: Hamrol, A., Ciszak, O., Legutko, S., Jurczyk, M. (eds.) Advances in Manufacturing. Lecture Notes in Mechanical Engineering, pp. 111–120. Springer, Cham (2018)

    Chapter  Google Scholar 

  8. Trojanowska, J., Kolinski, A., Galusik, D., Varela, M.L.R., Machado, J.: A methodology of improvement of manufacturing productivity through increasing operational efficiency of the production process. In: Hamrol, A., Ciszak, O., Legutko, S., Jurczyk, M. (eds.) Advances in Manufacturing. Lecture Notes in Mechanical Engineering, pp. 23–32. Springer, Cham (2018)

    Chapter  Google Scholar 

  9. Bülbül, K., Şen, H.: An exact extended formulation for the unrelated parallel machine total weighted completion time problem. J. Sched. 20(4), 373–389 (2017)

    Article  MathSciNet  Google Scholar 

  10. Aydilek, A., Aydilek, H., Allahverdi, A.: Minimising maximum tardiness in assembly flowshops with setup times. Int. J. Prod. Res., 1–25 (2017)

    Google Scholar 

  11. Zhang, S., Wong, T.N.: Studying the impact of sequence-dependent set-up times in integrated process planning and scheduling with E-ACO heuristic. Int. J. Prod. Res. 54(16), 4815–4838 (2016)

    Article  Google Scholar 

  12. Xu, L., Wang, Q., Huang, S.: Dynamic order acceptance and scheduling problem with sequence-dependent setup time. Int. J. Prod. Res. 53(19), 5797–5808 (2015)

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

  15. Woo, Y.B., Jung, S., Kim, B.S.: A rule-based genetic algorithm with an improvement heuristic for unrelated parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities. Comput. Ind. Eng. 109, 179–190 (2017)

    Article  Google Scholar 

  16. Abreu, L.R., Prata, B.A.: A hybrid genetic algorithm for solving the unrelated parallel machine scheduling problem with sequence dependent setup times. IEEE Lat. Am. Trans. 16(6), 1715–1722 (2018)

    Article  Google Scholar 

  17. Gedik, R., Kalathia, D., Egilmez, G., Kirac, E.: A constraint programming approach for solving unrelated parallel machine scheduling problem. Comput. Ind. Eng. 121, 139–149 (2018)

    Article  Google Scholar 

  18. Fanjul-Peyro, L., Perea, F., Ruiz, R.: Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources. Eur. J. Oper. Res. 260(2), 482–493 (2017)

    Article  MathSciNet  Google Scholar 

  19. Zheng, X.L., Wang, L.: A collaborative multiobjective fruit fly optimization algorithm for the resource constrained unrelated parallel machine green scheduling problem. IEEE Trans. Syst. Man Cybern.: Syst. 48(5), 790–800 (2018)

    Article  Google Scholar 

  20. Pinedo, M.: Scheduling - Theory, Algorithms, and Systems, 3rd edn. Prentice Hall, Upper Saddle River (2008)

    MATH  Google Scholar 

  21. Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of computer computations, pp. 85–103. Springer, Boston (1972)

    Google Scholar 

  22. Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to NP-completeness (1979)

    Google Scholar 

  23. Rabadi, G. (ed.): Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling, vol. 236. Springer, Cham (2016)

    MATH  Google Scholar 

  24. Academic Source Codes and Tutorials. www.yarpiz.com. Accessed 29 Sept 2018

  25. Scheduling Research Virtual Center Homepage. www.SchedulingResearch.com

Download references

Acknowledgement

This project is funded by COMPETE: POCI-01-0145-FEDER-007043 and FCT – Fundação para a Ciência e Tecnologia within the project scope: UID/CEC/00319/2013.

Author information

Authors and Affiliations

  1. Algoritmi Research Centre, University of Minho, 4800-058, Guimarães, Portugal

    Gabriela Amaral, Lino Costa, Ana Maria A. C. Rocha & Leonilde Varela

  2. Interdisciplinary Studies Research Center (ISRC), ISEP/IPP, Porto, Portugal

    Ana Madureira

Authors
  1. Gabriela Amaral
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lino Costa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ana Maria A. C. Rocha
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Leonilde Varela
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ana Madureira
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gabriela Amaral .

Editor information

Editors and Affiliations

  1. School of Engineering, Instituto Superior de Engenharia (ISEP/IPP), Porto, Portugal

    Ana Maria Madureira

  2. Machine Intelligence Research Labs (MIR Labs), Auburn, WA, USA

    Ajith Abraham

  3. Machine Intelligence Research Labs, Auburn, WA, USA

    Niketa Gandhi

  4. Department of Production and Systems, University of Minho, Guimarães, Portugal

    Maria Leonilde Varela

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

Amaral, G., Costa, L., Rocha, A.M.A.C., Varela, L., Madureira, A. (2020). Application of the Simulated Annealing Algorithm to Minimize the makespan on the Unrelated Parallel Machine Scheduling Problem with Setup Times. In: Madureira, A., Abraham, A., Gandhi, N., Varela, M. (eds) Hybrid Intelligent Systems. HIS 2018. Advances in Intelligent Systems and Computing, vol 923. Springer, Cham. https://doi.org/10.1007/978-3-030-14347-3_39

Download citation

Publish with us

Policies and ethics

Search

Navigation

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy