{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:15:06Z","timestamp":1743084906141,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031381645"},{"type":"electronic","value":"9783031381652"}],"license":[{"start":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T00:00:00Z","timestamp":1692921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T00:00:00Z","timestamp":1692921600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-38165-2_129","type":"book-chapter","created":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T20:25:55Z","timestamp":1692908755000},"page":"1130-1138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Analysis of Constructive Heuristics with Cuckoo Search Algorithm, Firefly Algorithm and Simulated Annealing in Scheduling Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4416-9644","authenticated-orcid":false,"given":"Carlota","family":"Moreira","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7899-1252","authenticated-orcid":false,"given":"Catarina","family":"Costa","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7172-4557","authenticated-orcid":false,"given":"Andr\u00e9 S.","family":"Santos","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0264-4710","authenticated-orcid":false,"given":"Ana M.","family":"Madureira","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4486-5482","authenticated-orcid":false,"given":"Marta","family":"Barbosa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,25]]},"reference":[{"issue":"1","key":"129_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.omega.2005.03.003","volume":"35","author":"PJ Kalczynski","year":"2007","unstructured":"Kalczynski, P.J., Kamburowski, J.: On the NEH heuristic for minimizing the makespan in permutation flow shops. Omega 35(1), 53\u201360 (2007)","journal-title":"Omega"},{"issue":"112","key":"129_CR2","first-page":"1","volume":"13","author":"C Sauvey","year":"2020","unstructured":"Sauvey, C., Sauer, N.: Two NEH heuristic improvements for Flowshop scheduling problem with Makespan criterion. Algorithms 13(112), 1\u201314 (2020)","journal-title":"Algorithms"},{"issue":"June","key":"129_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ijpe.2017.06.026","volume":"193","author":"W Liu","year":"2017","unstructured":"Liu, W., Jin, Y., Price, M.: A new improved NEH heuristic for permutation flowshop scheduling problems. Int. J. Prod. Econ. 193(June), 21\u201330 (2017)","journal-title":"Int. J. Prod. Econ."},{"issue":"3","key":"129_CR4","doi-asserted-by":"publisher","first-page":"311","DOI":"10.5267\/j.dsl.2021.2.006","volume":"10","author":"M Sharma","year":"2021","unstructured":"Sharma, M., Sharma, M., Sharma, S.: An improved NEH heuristic to minimize makespan for flow shop scheduling problems. Decis. Sci. Lett. 10(3), 311\u2013322 (2021)","journal-title":"Decis. Sci. Lett."},{"issue":"2","key":"129_CR5","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/0377-2217(93)E0228-P","volume":"80","author":"C Chen","year":"1995","unstructured":"Chen, C., Vempati, V.S., Aljaber, N.: An application of genetic algorithms for flow shop problems. Eur. J. Oper. Res. 80(2), 389\u2013396 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"129_CR6","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.jbusres.2018.10.018","volume":"107","author":"A Sharma","year":"2020","unstructured":"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\u2013152 (2020)","journal-title":"J. Bus. Res."},{"issue":"6","key":"129_CR7","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1080\/00207548808947922","volume":"26","author":"P Taylor","year":"1988","unstructured":"Taylor, P., Hundal, T.S., Rajgopal, J.: An extension of Palmer\u2019s heuristic for the flow shop scheduling problem. Int. J. Prod. Res. 26(6), 1119\u20131124 (1988)","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"129_CR8","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0377-2217(91)90080-F","volume":"52","author":"JC Ho","year":"1991","unstructured":"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\u2013202 (1991)","journal-title":"Eur. J. Oper. Res."},{"key":"129_CR9","doi-asserted-by":"crossref","unstructured":"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\u20139 (2019)","DOI":"10.1051\/e3sconf\/201912523009"},{"key":"129_CR10","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1088\/1757-899X\/528\/1\/012045"},{"issue":"1","key":"129_CR11","doi-asserted-by":"publisher","first-page":"95","DOI":"10.12928\/si.v18i1.15869","volume":"18","author":"CD Smith","year":"2020","unstructured":"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\u2013102 (2020)","journal-title":"Spektrum Ind."},{"issue":"2","key":"129_CR12","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0925-5273(03)00092-6","volume":"87","author":"S Melouk","year":"2004","unstructured":"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\u2013147 (2004)","journal-title":"Int. J. Prod. Econ."},{"issue":"6","key":"129_CR13","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1016\/S0305-0548(01)00056-9","volume":"29","author":"SJ D\u2019Amico","year":"2002","unstructured":"D\u2019Amico, S.J., Wang, S.J., Batta, R., Rump, C.M.: A simulated annealing approach to police district design. Comput. Oper. Res. 29(6), 667\u2013684 (2002)","journal-title":"Comput. Oper. Res."},{"key":"129_CR14","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.asoc.2014.02.005","volume":"19","author":"MK Marichelvam","year":"2014","unstructured":"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\u2013101 (2014)","journal-title":"Appl. Soft Comput. J."},{"key":"129_CR15","unstructured":"de Alencar, M.R.B., de Souza, B.A., Neves, W.L.A., Ferraz, R.S.F.: Aplica\u00e7\u00e3o de Algoritmo de Busca Cuco no Dimensionamento \u00d3timo de Gerador Fotovoltaico para Redu\u00e7\u00e3o de Custos, pp. 731\u2013736 (2019)"},{"key":"129_CR16","doi-asserted-by":"publisher","unstructured":"Moreira, C., Costa, C., Santos, A.S., Bastos, J.A., Varela, L.R., Brito, M.F.: Firefly and cuckoo search algorithm for scheduling problems: a performance analysis. In: Machado, J., et al. (eds.) ICIENG 2022. LNME, pp. 75\u201388. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-09360-9_7","DOI":"10.1007\/978-3-031-09360-9_7"},{"key":"129_CR17","doi-asserted-by":"crossref","unstructured":"Yang, X.S., Karamanoglu, M.: Swarm Intelligence and Bio-Inspired Computation: An Overview (2013)","DOI":"10.1016\/B978-0-12-405163-8.00001-6"},{"key":"129_CR18","doi-asserted-by":"publisher","first-page":"1798","DOI":"10.1016\/j.proeng.2014.12.333","volume":"97","author":"KC Udaiyakumar","year":"2014","unstructured":"Udaiyakumar, K.C., Chandrasekaran, M.: Application of firefly algorithm in job shop scheduling problem for minimization of Makespan. Procedia Eng. 97, 1798\u20131807 (2014)","journal-title":"Procedia Eng."},{"key":"129_CR19","doi-asserted-by":"crossref","unstructured":"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\u2013589 (2019)","DOI":"10.1109\/JEEIT.2019.8717463"},{"key":"129_CR20","unstructured":"Kota and, L., J\u00e1rmai, K.: Discretization of the Firefly Algorithm for the Travelling Salesman Problem (2013)"},{"key":"129_CR21","unstructured":"Aarts, E., Korst, J.: Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. Wiley, New York"},{"key":"129_CR22","doi-asserted-by":"publisher","unstructured":"Kolisch, R., Hartmann, S.: Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis. In: W\u0119glarz, J. (ed.) Project Scheduling. Springer, Boston (1999). https:\/\/doi.org\/10.1007\/978-1-4615-5533-9_7","DOI":"10.1007\/978-1-4615-5533-9_7"},{"key":"129_CR23","unstructured":"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)"},{"issue":"2","key":"129_CR24","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10489-017-0972-6","volume":"48","author":"J Garc\u00eda","year":"2017","unstructured":"Garc\u00eda, J., Crawford, B., Soto, R., Castro, C., Paredes, F.: A k-means binarization framework applied to multidimensional knapsack problem. Appl. Intell. 48(2), 357\u2013380 (2017). https:\/\/doi.org\/10.1007\/s10489-017-0972-6","journal-title":"Appl. Intell."},{"issue":"3","key":"129_CR25","first-page":"2266","volume":"11","author":"D Belbachir","year":"2021","unstructured":"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\u20132274 (2021)","journal-title":"Int. J. Electr. Comput. Eng."},{"key":"129_CR26","unstructured":"Gleason, J.: Comparative Power of the Anova, Randomization Anova, and Kruskal-Wallis Test. Detroit, Michigan (2013)"}],"container-title":["Lecture Notes in Mechanical Engineering","Flexible Automation and Intelligent Manufacturing: Establishing Bridges for More Sustainable Manufacturing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38165-2_129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T07:25:22Z","timestamp":1707290722000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38165-2_129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,25]]},"ISBN":["9783031381645","9783031381652"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38165-2_129","relation":{},"ISSN":["2195-4356","2195-4364"],"issn-type":[{"type":"print","value":"2195-4356"},{"type":"electronic","value":"2195-4364"}],"subject":[],"published":{"date-parts":[[2023,8,25]]},"assertion":[{"value":"25 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Flexible Automation and Intelligent Manufacturing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faim2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.faimconference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}