Skip to main content
Top

2024 | OriginalPaper | Chapter

Analysis of Constructive Heuristics with Cuckoo Search Algorithm, Firefly Algorithm and Simulated Annealing in Scheduling Problems

Authors : Carlota Moreira, Catarina Costa, André S. Santos, Ana M. Madureira, Marta Barbosa

Published in: Flexible Automation and Intelligent Manufacturing: Establishing Bridges for More Sustainable Manufacturing Systems

Publisher: Springer Nature Switzerland

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

This chapter delves into the analysis of constructive heuristics combined with nature-based metaheuristics, specifically the Cuckoo Search Algorithm, Firefly Algorithm, and Simulated Annealing, in the context of scheduling problems. It begins with an introduction to these metaheuristics and their adaptability to various optimization problems. The literature review highlights key constructive heuristics such as NEH, Palmer, and CDS, and discusses their effectiveness in minimizing makespan. The chapter then presents the problem context, parameterization of metaheuristics, and statistical analysis of the results. The statistical evaluation, using Kruskal-Wallis and Dunn's Post Hoc tests, reveals significant differences between the combinations of metaheuristics and heuristics. The results show that while the Firefly Algorithm with NEH (FA-NEH) generally provides the best solutions, it requires more runtime. Simulated Annealing with Palmer and CDS (SA-Palmer and SA-CDS) offers a better balance of effectiveness and efficiency. The chapter concludes with insights into the robustness of the algorithms and suggestions for future work, including the potential for hybrid metaheuristics.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Kalczynski, P.J., Kamburowski, J.: On the NEH heuristic for minimizing the makespan in permutation flow shops. Omega 35(1), 53–60 (2007)CrossRef Kalczynski, P.J., Kamburowski, J.: On the NEH heuristic for minimizing the makespan in permutation flow shops. Omega 35(1), 53–60 (2007)CrossRef
2.
go back to reference Sauvey, C., Sauer, N.: Two NEH heuristic improvements for Flowshop scheduling problem with Makespan criterion. Algorithms 13(112), 1–14 (2020)MathSciNet Sauvey, C., Sauer, N.: Two NEH heuristic improvements for Flowshop scheduling problem with Makespan criterion. Algorithms 13(112), 1–14 (2020)MathSciNet
3.
go back to reference Liu, W., Jin, Y., Price, M.: A new improved NEH heuristic for permutation flowshop scheduling problems. Int. J. Prod. Econ. 193(June), 21–30 (2017)CrossRef Liu, W., Jin, Y., Price, M.: A new improved NEH heuristic for permutation flowshop scheduling problems. Int. J. Prod. Econ. 193(June), 21–30 (2017)CrossRef
4.
go back to reference Sharma, M., Sharma, M., Sharma, S.: An improved NEH heuristic to minimize makespan for flow shop scheduling problems. Decis. Sci. Lett. 10(3), 311–322 (2021)CrossRef Sharma, M., Sharma, M., Sharma, S.: An improved NEH heuristic to minimize makespan for flow shop scheduling problems. Decis. Sci. Lett. 10(3), 311–322 (2021)CrossRef
5.
go back to reference Chen, C., Vempati, V.S., Aljaber, N.: An application of genetic algorithms for flow shop problems. Eur. J. Oper. Res. 80(2), 389–396 (1995)CrossRef Chen, C., Vempati, V.S., Aljaber, N.: An application of genetic algorithms for flow shop problems. Eur. J. Oper. Res. 80(2), 389–396 (1995)CrossRef
6.
go back to reference Sharma, A., Moses, A.C., Borah, S.B., Adhikary, A.: Investigating the impact of workforce racial diversity on the organizational corporate social responsibility performance: an institutional logics perspective. J. Bus. Res. 107, 138–152 (2020)CrossRef Sharma, A., Moses, A.C., Borah, S.B., Adhikary, A.: Investigating the impact of workforce racial diversity on the organizational corporate social responsibility performance: an institutional logics perspective. J. Bus. Res. 107, 138–152 (2020)CrossRef
7.
go back to reference Taylor, P., Hundal, T.S., Rajgopal, J.: An extension of Palmer’s heuristic for the flow shop scheduling problem. Int. J. Prod. Res. 26(6), 1119–1124 (1988)CrossRef Taylor, P., Hundal, T.S., Rajgopal, J.: An extension of Palmer’s heuristic for the flow shop scheduling problem. Int. J. Prod. Res. 26(6), 1119–1124 (1988)CrossRef
8.
go back to reference Ho, J.C., Chang, Y.-L.: Theory and methodology a new heuristic for the n-job, M-machine flow-shop problem. Eur. J. Oper. Res. 52(2), 194–202 (1991)CrossRef Ho, J.C., Chang, Y.-L.: Theory and methodology a new heuristic for the n-job, M-machine flow-shop problem. Eur. J. Oper. Res. 52(2), 194–202 (1991)CrossRef
9.
go back to reference Mashuri, C., Mujianto, A.H., Sucipto, H., Arsam, R.Y., Permadi, G.S.: Production time optimization using Campbell Dudek Smith (CDS) algorithm for production scheduling. E3S Web Conf. 9(201 9), 5–9 (2019) Mashuri, C., Mujianto, A.H., Sucipto, H., Arsam, R.Y., Permadi, G.S.: Production time optimization using Campbell Dudek Smith (CDS) algorithm for production scheduling. E3S Web Conf. 9(201 9), 5–9 (2019)
10.
go back to reference Charpentier, P.: Design of job scheduling system and software for packaging process with SPT, EDD, LPT, CDS and NEH algorithm at PT. ACP Desi g n of job scheduling system and software for packaging process with SPT, EDD, LPT, CDS and NEH algorithm at PT. IOP Conf. Ser. Mater. Sci. Eng. 528(1), 012045 (2019) Charpentier, P.: Design of job scheduling system and software for packaging process with SPT, EDD, LPT, CDS and NEH algorithm at PT. ACP Desi g n of job scheduling system and software for packaging process with SPT, EDD, LPT, CDS and NEH algorithm at PT. IOP Conf. Ser. Mater. Sci. Eng. 528(1), 012045 (2019)
11.
go back to reference Smith, C.D., Pour, H.: Makespan minimization in batik Murni SMEs with palmer, Campbell Dukdek Smith, and heuristic pour algorithm. Spektrum Ind. 18(1), 95–102 (2020)CrossRef Smith, C.D., Pour, H.: Makespan minimization in batik Murni SMEs with palmer, Campbell Dukdek Smith, and heuristic pour algorithm. Spektrum Ind. 18(1), 95–102 (2020)CrossRef
12.
go back to reference Melouk, S., Damodaran, P., Chang, P.Y.: Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing. Int. J. Prod. Econ. 87(2), 141–147 (2004)CrossRef Melouk, S., Damodaran, P., Chang, P.Y.: Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing. Int. J. Prod. Econ. 87(2), 141–147 (2004)CrossRef
13.
go back to reference D’Amico, S.J., Wang, S.J., Batta, R., Rump, C.M.: A simulated annealing approach to police district design. Comput. Oper. Res. 29(6), 667–684 (2002)CrossRef D’Amico, S.J., Wang, S.J., Batta, R., Rump, C.M.: A simulated annealing approach to police district design. Comput. Oper. Res. 29(6), 667–684 (2002)CrossRef
14.
go back to reference Marichelvam, M.K., Prabaharan, T., Yang, X.S.: Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan. Appl. Soft Comput. J. 19, 93–101 (2014)CrossRef Marichelvam, M.K., Prabaharan, T., Yang, X.S.: Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan. Appl. Soft Comput. J. 19, 93–101 (2014)CrossRef
15.
go back to reference de Alencar, M.R.B., de Souza, B.A., Neves, W.L.A., Ferraz, R.S.F.: Aplicação de Algoritmo de Busca Cuco no Dimensionamento Ótimo de Gerador Fotovoltaico para Redução de Custos, pp. 731–736 (2019) de Alencar, M.R.B., de Souza, B.A., Neves, W.L.A., Ferraz, R.S.F.: Aplicação de Algoritmo de Busca Cuco no Dimensionamento Ótimo de Gerador Fotovoltaico para Redução de Custos, pp. 731–736 (2019)
16.
17.
go back to reference Yang, X.S., Karamanoglu, M.: Swarm Intelligence and Bio-Inspired Computation: An Overview (2013) Yang, X.S., Karamanoglu, M.: Swarm Intelligence and Bio-Inspired Computation: An Overview (2013)
18.
go back to reference Udaiyakumar, K.C., Chandrasekaran, M.: Application of firefly algorithm in job shop scheduling problem for minimization of Makespan. Procedia Eng. 97, 1798–1807 (2014)CrossRef Udaiyakumar, K.C., Chandrasekaran, M.: Application of firefly algorithm in job shop scheduling problem for minimization of Makespan. Procedia Eng. 97, 1798–1807 (2014)CrossRef
19.
go back to reference Jaradat, A., Matalkeh, B., Diabat, W.: Solving traveling salesman problem using firefly algorithm and k-means clustering. In: 2019 IEEE Jordan International Joint. Conference on Electronic Engineering Information Technology JEEIT 2019 - Proceedings, no. September, pp. 586–589 (2019) Jaradat, A., Matalkeh, B., Diabat, W.: Solving traveling salesman problem using firefly algorithm and k-means clustering. In: 2019 IEEE Jordan International Joint. Conference on Electronic Engineering Information Technology JEEIT 2019 - Proceedings, no. September, pp. 586–589 (2019)
20.
go back to reference Kota and, L., Jármai, K.: Discretization of the Firefly Algorithm for the Travelling Salesman Problem (2013) Kota and, L., Jármai, K.: Discretization of the Firefly Algorithm for the Travelling Salesman Problem (2013)
21.
go back to reference Aarts, E., Korst, J.: Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. Wiley, New York Aarts, E., Korst, J.: Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. Wiley, New York
23.
go back to reference Khadwilard, A., Chansombat, S., Thepphakorn, T., Thapatsuwan, P., Chainate, W., Pongcharoen, P.: Application of firefly algorithm and its parameter setting for job shop scheduling. In: First Symposium Hands-On Research Development, vol. 1, no. 1 (2011) Khadwilard, A., Chansombat, S., Thepphakorn, T., Thapatsuwan, P., Chainate, W., Pongcharoen, P.: Application of firefly algorithm and its parameter setting for job shop scheduling. In: First Symposium Hands-On Research Development, vol. 1, no. 1 (2011)
25.
go back to reference Belbachir, D., Boumediene, F., Hassam, A., Ghomri, L.: Adaptation and parameters studies of CS algorithm for flow shop scheduling problem. Int. J. Electr. Comput. Eng. 11(3), 2266–2274 (2021) Belbachir, D., Boumediene, F., Hassam, A., Ghomri, L.: Adaptation and parameters studies of CS algorithm for flow shop scheduling problem. Int. J. Electr. Comput. Eng. 11(3), 2266–2274 (2021)
26.
go back to reference Gleason, J.: Comparative Power of the Anova, Randomization Anova, and Kruskal-Wallis Test. Detroit, Michigan (2013) Gleason, J.: Comparative Power of the Anova, Randomization Anova, and Kruskal-Wallis Test. Detroit, Michigan (2013)
Metadata
Title
Analysis of Constructive Heuristics with Cuckoo Search Algorithm, Firefly Algorithm and Simulated Annealing in Scheduling Problems
Authors
Carlota Moreira
Catarina Costa
André S. Santos
Ana M. Madureira
Marta Barbosa
Copyright Year
2024
DOI
https://doi.org/10.1007/978-3-031-38165-2_129

Premium Partner