{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:47:38Z","timestamp":1774630058057,"version":"3.50.1"},"reference-count":87,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2021,3,11]],"date-time":"2021-03-11T00:00:00Z","timestamp":1615420800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,11]],"date-time":"2021-03-11T00:00:00Z","timestamp":1615420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004410","name":"T\u00fcrkiye Bilimsel ve Teknolojik Arastirma Kurumu","doi-asserted-by":"publisher","award":["118E355"],"award-info":[{"award-number":["118E355"]}],"id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s00500-021-05673-w","type":"journal-article","created":{"date-parts":[[2021,3,11]],"date-time":"2021-03-11T02:03:44Z","timestamp":1615428224000},"page":"7143-7154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Solution for flow shop scheduling problems using chaotic hybrid firefly and particle swarm optimization algorithm with improved local search"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1555-5493","authenticated-orcid":false,"given":"Serkan","family":"Kaya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5948-595X","authenticated-orcid":false,"given":"Abd\u00fclkadir","family":"G\u00fcm\u00fc\u015f\u00e7\u00fc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8037-8625","authenticated-orcid":false,"given":"\u0130brahim Berkan","family":"Aydilek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8540-8050","authenticated-orcid":false,"given":"\u0130zzettin Hakan","family":"Kara\u00e7izmeli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5944-4704","authenticated-orcid":false,"given":"Mehmet Emin","family":"Tenekeci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,11]]},"reference":[{"issue":"2","key":"5673_CR1","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/j.cie.2012.03.015","volume":"63","author":"F Ahmadizar","year":"2012","unstructured":"Ahmadizar F (2012) A new ant colony algorithm for makespan minimization in permutation ow shops. Comput Ind Eng 63(2):355\u2013361","journal-title":"Comput Ind Eng"},{"issue":"2","key":"5673_CR2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0925-5273(03)00184-1","volume":"88","author":"C Andreas","year":"2004","unstructured":"Andreas C (2004) Nearchou. The effect of various operators on the genetic search for large scheduling problems. Int J Prod Econ 88(2):191\u2013203","journal-title":"Int J Prod Econ"},{"key":"5673_CR3","unstructured":"Aydilek \u0130, Tenekeci E, Kara\u00e7izmeli \u0130, Kaya S, G\u00fcm\u00fc\u015f\u00e7\u00fc A (2019) Hibrit Ate\u015fb\u00f6ce\u011fi ve Par\u00e7ac\u0131k S\u00fcr\u00fc Algoritmas\u0131n\u0131n Kaotik Haritalar ile \u0130yile\u015ftirilmesi. Harran \u00dcniversitesi M\u00fchendislik Dergisi 4(2):69\u201378 Retrieved from https:\/\/dergipark.org.tr\/tr\/pub\/humder\/issue\/47643\/560803"},{"key":"5673_CR4","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.cor.2018.07.017","volume":"100","author":"J Benavides Alexander","year":"2018","unstructured":"Benavides Alexander J, Marcus R (2018) Fast heuristics for minimizing the makespan in non- permutation ow shops. Comput Oper Res 100:230\u2013243. https:\/\/doi.org\/10.1016\/j.cor.2018.07.017","journal-title":"Comput Oper Res"},{"key":"5673_CR5","first-page":"16","volume":"16","author":"HG Campbell","year":"1970","unstructured":"Campbell HG, Dudek RA, Smith BL (1970) A heuristic algorithm for the N-job, mmachine sequencing problem. Manage Sci 16:16","journal-title":"Manage Sci"},{"key":"5673_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-020-01875-1","author":"KK Chakravarthi","year":"2020","unstructured":"Chakravarthi KK, Shyamala L, Vaidehi V (2020) Cost-effective workflow scheduling approach on cloud under deadline constraint using firefly algorithm. Appl Intell. https:\/\/doi.org\/10.1007\/s10489-020-01875-1","journal-title":"Appl Intell"},{"issue":"1","key":"5673_CR7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.ijpe.2012.06.007","volume":"141","author":"P-C Chang","year":"2013","unstructured":"Chang P-C, Huang W-H, Wu J-L, Cheng T (2013) A block mining and re-com- bination enhanced genetic algorithm for the permutation owshop scheduling problem. Int J Prod Econ 141(1):45\u201355","journal-title":"Int J Prod Econ"},{"issue":"2","key":"5673_CR8","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1016\/j.cie.2011.11.002","volume":"62","author":"Y-M Chen","year":"2012","unstructured":"Chen Y-M, Chen M-C, Chang P-C, Chen S-H (2012) Extended articial chromo- somes genetic algorithm for permutation owshop scheduling problems. Comput Ind Eng 62(2):536\u2013545","journal-title":"Comput Ind Eng"},{"issue":"12","key":"5673_CR9","doi-asserted-by":"crossref","first-page":"3962","DOI":"10.1016\/j.cor.2007.05.005","volume":"35","author":"X Dong","year":"2008","unstructured":"Dong X, Huang H, Chen P (2008) An improved NEH-based heuristic for the permutation owshop problem. Comput Oper Res 35(12):3962\u20133968","journal-title":"Comput Oper Res"},{"key":"5673_CR10","doi-asserted-by":"publisher","first-page":"4331","DOI":"10.1007\/s10586-018-1873-0","volume":"22","author":"L Dong","year":"2019","unstructured":"Dong L, Yang Y, Sun S (2019) QCs scheduling scheme of genetic algorithm (GA) and improved firefly algorithm (FA). Cluster Comput 22:4331\u20134348. https:\/\/doi.org\/10.1007\/s10586-018-1873-0","journal-title":"Cluster Comput"},{"issue":"3","key":"5673_CR11","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1287\/opre.12.3.471","volume":"12","author":"A Dudek Richard","year":"1964","unstructured":"Dudek Richard A, Foy TO (1964) Development of M-stage decision rule for scheduling N jobs through m machines. Oper Res 12(3):471\u2013497. https:\/\/doi.org\/10.1287\/opre.12.3.471","journal-title":"Oper Res"},{"key":"5673_CR12","unstructured":"Durkota K (2011) Implementation of a discrete firefly algorithm for the QAP problem within the sage framework. BSc thesis. Czech Technical University"},{"issue":"1","key":"5673_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cie.2007.04.004","volume":"54","author":"B Ek\u015fio\u011flu","year":"2008","unstructured":"Ek\u015fio\u011flu B, Ek\u015fio\u011flu SD, Jain P (2008) A tabu search algorithm for the owshop scheduling problem with changing neighborhoods. Comput Ind Eng 54(1):1\u201311","journal-title":"Comput Ind Eng"},{"key":"5673_CR14","doi-asserted-by":"publisher","first-page":"399","DOI":"10.5267\/j.ijiec.2017.2.001","volume":"8","author":"M Eliana","year":"2017","unstructured":"Eliana M, Gonz\u00e1lez-Neiraa B, Jairo R, Montoya T, David B (2017) Flow-shop scheduling problem under uncertainties: review and trends. Int J Ind Eng Comput 8:399\u2013426. https:\/\/doi.org\/10.5267\/j.ijiec.2017.2.001","journal-title":"Int J Ind Eng Comput"},{"key":"5673_CR15","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1007\/s12652-018-0903-3","volume":"10","author":"B Fan","year":"2019","unstructured":"Fan B, Yang W, Zhang Z (2019) Solving the two-stage hybrid flow shop scheduling problem based on mutant firefly algorithm. J Ambient Intell Human Comput 10:979\u2013990. https:\/\/doi.org\/10.1007\/s12652-018-0903-3","journal-title":"J Ambient Intell Human Comput"},{"issue":"2","key":"5673_CR16","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/j.omega.2007.02.002","volume":"37","author":"S FarahmandRad","year":"2009","unstructured":"FarahmandRad S, Ruiz R, Boroojerdian N (2009) New high performing heuristics for minimizing makespan in permutation owshops. Omega 37(2):331\u2013345","journal-title":"Omega"},{"key":"5673_CR17","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.cor.2013.12.012","volume":"45","author":"V Fernandez-Viagas","year":"2014","unstructured":"Fernandez-Viagas V, Framinan JM (2014) On insertion tie-breaking rules in heuris- tics for the permutation owshop scheduling problem. Comput Oper Res 45:60\u201367","journal-title":"Comput Oper Res"},{"key":"5673_CR18","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.cor.2013.12.012","volume":"45","author":"V Fernandez-Viagas","year":"2014","unstructured":"Fernandez-Viagas V, Framinan JM (2014) On insertion tie-breaking rules in heuristics for the permutation owshop scheduling problem. Comput Oper Res 45:60\u201367","journal-title":"Comput Oper Res"},{"issue":"23\u201324","key":"5673_CR19","doi-asserted-by":"publisher","first-page":"2325","DOI":"10.1016\/j.compstruc.2011.08.002","volume":"89","author":"AH Gandomi","year":"2011","unstructured":"Gandomi AH, Yang X-S, Alavi AH (2011) Mixed variable structural optimization using firefly algorithm computers structures. Comput Struct 89(23\u201324):2325\u20132336. https:\/\/doi.org\/10.1016\/j.compstruc.2011.08.002","journal-title":"Comput Struct"},{"issue":"11","key":"5673_CR20","doi-asserted-by":"crossref","first-page":"1891","DOI":"10.1016\/S0305-0548(03)00145-X","volume":"31","author":"J Grabowski","year":"2004","unstructured":"Grabowski J, Wodecki M (2004) A very fast tabu search algorithm for the permu- tation ow shop problem with makespan criterion. Comput Oper Res 31(11):1891\u20131909","journal-title":"Comput Oper Res"},{"issue":"1","key":"5673_CR21","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1057\/jors.1971.18","volume":"22","author":"JN Gupta","year":"1971","unstructured":"Gupta JN (1971) A functional heuristic algorithm for the flowshop scheduling problem. J Oper Res Soc 22(1):39\u201347","journal-title":"J Oper Res Soc"},{"issue":"7\u20138","key":"5673_CR22","first-page":"731","volume":"31","author":"AN Haq","year":"2007","unstructured":"Haq AN, Saravanan M, Vivekraj AR, Prasad T (2007) A scatter search approach for general owshop scheduling problem. Int J Adv Manuf Technol 31(7\u20138):731\u2013736","journal-title":"Int J Adv Manuf Technol"},{"issue":"33","key":"5673_CR23","first-page":"256","volume":"724","author":"U Honig","year":"2010","unstructured":"Honig U (2010) A firefly algorithm-based approach for scheduling task graphs in homogeneous systems. Proc IASTED Int Conf 724(33):256\u2013263","journal-title":"Proc IASTED Int Conf"},{"key":"5673_CR24","doi-asserted-by":"crossref","first-page":"1984","DOI":"10.1016\/j.amc.2009.07.033","volume":"215","author":"YC Hsieh","year":"2009","unstructured":"Hsieh YC, You PS, Liou CD (2009) A note of using effective immune based approach for the ow shop scheduling with buffers. Appl Math Comput 215:1984\u20131989","journal-title":"Appl Math Comput"},{"issue":"4","key":"5673_CR25","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.1016\/j.cor.2006.07.003","volume":"35","author":"KL Huang","year":"2006","unstructured":"Huang KL, Liao CJ (2006) Ant colony optimization combined with tabu search for the job shop scheduling problem. Comput Oper Res 35(4):1030\u20131046","journal-title":"Comput Oper Res"},{"key":"5673_CR26","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/924652","author":"L Hui","year":"2014","unstructured":"Hui L, Xiaoteng W, Zongming F, Meikang Q (2014) The effects of using chaotic map on improving the performance of multiobjective evolutionary algorithms. Math Probl Eng. https:\/\/doi.org\/10.1155\/2014\/924652","journal-title":"Math Probl Eng"},{"key":"5673_CR27","doi-asserted-by":"publisher","first-page":"4297","DOI":"10.1007\/s00500-016-2062-9","volume":"21","author":"W Hui","year":"2017","unstructured":"Hui W, Wenjun W, Hui S, Zhihua C, Shahryar R, Sanyou Z (2017) A new cuckoo search algorithm with hybrid strategies for ow shop scheduling problems. Soft Comput 21:4297\u20134307. https:\/\/doi.org\/10.1007\/s00500-016-2062-9","journal-title":"Soft Comput"},{"key":"5673_CR28","doi-asserted-by":"publisher","first-page":"1568","DOI":"10.1016\/j.asoc.2018.02.025","volume":"66","author":"BA \u0130brahim","year":"2018","unstructured":"\u0130brahim BA (2018) A hybrid firefly and particle swarm optimization algorithm for computationally expensive numerical problems. Appl Soft Comput 66:1568\u20134946. https:\/\/doi.org\/10.1016\/j.asoc.2018.02.025","journal-title":"Appl Soft Comput"},{"key":"5673_CR29","doi-asserted-by":"crossref","unstructured":"Johnson SM (1954) Optimal two and three stage production schedules with setup time included. Naval Research Logistics Quarterly, pp 61\u201368","DOI":"10.1002\/nav.3800010110"},{"issue":"1","key":"5673_CR30","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ejor.2008.08.021","volume":"198","author":"PJ Kalczynski","year":"2009","unstructured":"Kalczynski PJ, Kamburowski J (2009) An empirical analysis of the optimality rate of ow shop heuristics. Eur J Oper Res 198(1):93\u2013101","journal-title":"Eur J Oper Res"},{"key":"5673_CR31","doi-asserted-by":"publisher","first-page":"6302","DOI":"10.1007\/s11227-019-02816-7","volume":"76","author":"SMG Kashikolaei","year":"2020","unstructured":"Kashikolaei SMG, Hosseinabadi AAR, Saemi B, Shareh MB et al (2020) An enhancement of task scheduling in cloud computing based on imperialist competitive algorithm and frefy algorithm. J Supercomput 76:6302\u20136329. https:\/\/doi.org\/10.1007\/s11227-019-02816-7","journal-title":"J Supercomput"},{"key":"5673_CR32","unstructured":"Kaya S, \u00c7elik A, Kara\u00e7izmeli \u0130H, Aydilek \u0130B, G\u00fcm\u00fc\u015f\u00e7\u00fc A, Tenekeci ME (2019) Mathematical model of flow shop scheduling problems and solution with metaheuristic methods. In: International Conference On Data Science, Machinelearning And Statistics\u20142019 (Dms-2019)"},{"key":"5673_CR33","doi-asserted-by":"publisher","unstructured":"Kaya S, Kara\u00e7izmeli \u0130H, Aydilek \u0130B, Tenekeci ME, G\u00fcm\u00fc\u015f\u00e7\u00fc A (2019) The effects of initial populations in the solution of flow shop scheduling problems by hybrid firefly and particle swarm optimization algorithms. Pamukkale Univ J Eng Sci. https:\/\/doi.org\/10.5505\/pajes.2019.94763","DOI":"10.5505\/pajes.2019.94763"},{"issue":"1","key":"5673_CR34","first-page":"49","volume":"8","author":"A Khadwilard","year":"2012","unstructured":"Khadwilard A, Chansombat S, Thepphakorn T, Chainate W, Pongcharoen P (2012) Application of firefly algorithm and its parameter setting for job shop scheduling. J Ind Technol 8(1):49\u201358","journal-title":"J Ind Technol"},{"key":"5673_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/s11831-020-09498-y","author":"V Kumar","year":"2020","unstructured":"Kumar V, Kumar DA (2020) Systematic review on firefly algorithm: past, present, and future. Arch Comput Methods Eng. https:\/\/doi.org\/10.1007\/s11831-020-09498-y","journal-title":"Arch Comput Methods Eng"},{"issue":"2","key":"5673_CR36","first-page":"363","volume":"60","author":"J Kwiecie\u0144","year":"2012","unstructured":"Kwiecie\u0144 J, Filipowicz B (2012) Firefly algorithm in optimization of queueing systems. Bull Polish Acad Sci Tech Sci 60(2):363\u2013368","journal-title":"Bull Polish Acad Sci Tech Sci"},{"issue":"5","key":"5673_CR37","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1287\/mnsc.39.5.616","volume":"39","author":"C-Y Lee","year":"1993","unstructured":"Lee C-Y, Cheng TCE, Lin BMT (1993) Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. Manage Sci 39(5):616\u2013625. https:\/\/doi.org\/10.1287\/mnsc.39.5.616","journal-title":"Manage Sci"},{"issue":"6","key":"5673_CR38","doi-asserted-by":"crossref","first-page":"1921","DOI":"10.1016\/j.scient.2012.10.034","volume":"19","author":"X Li","year":"2012","unstructured":"Li X, Yin M (2012) A discrete articial bee colony algorithm with composite mutation strategies for permutation ow shop scheduling problem. Scientia Iranica 19(6):1921\u20131935","journal-title":"Scientia Iranica"},{"issue":"16","key":"5673_CR39","doi-asserted-by":"crossref","first-page":"4732","DOI":"10.1080\/00207543.2013.767988","volume":"51","author":"X Li","year":"2013","unstructured":"Li X, Yin M (2013) A hybrid cuckoo search via L\u00e9vy ights for the permutation ow shop scheduling problem. Int J Prod Res 51(16):4732\u20134754","journal-title":"Int J Prod Res"},{"key":"5673_CR40","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.advengsoft.2012.09.003","volume":"55","author":"X Li","year":"2013","unstructured":"Li X, Yin M (2013) An opposition-based differential evolution algorithm for permutation ow shop scheduling based on diversity measure. Adv Eng Softw 55:10\u201331","journal-title":"Adv Eng Softw"},{"issue":"5","key":"5673_CR41","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1016\/j.chaos.2006.05.082","volume":"35","author":"Z Lian","year":"2008","unstructured":"Lian Z, Gu X, Jiao B (2008) A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan. Chaos Solitons Fractals 35(5):851\u2013861","journal-title":"Chaos Solitons Fractals"},{"key":"5673_CR42","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/j.cie.2015.04.009","volume":"85","author":"Q Lin","year":"2015","unstructured":"Lin Q, Gao L, Li X, Zhang C (2015b) A hybrid backtracking search algorithm for permutation ow-shop scheduling problem. Comput Ind Eng 85:437\u2013446","journal-title":"Comput Ind Eng"},{"issue":"3","key":"5673_CR43","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1016\/j.asoc.2011.10.024","volume":"13","author":"Y-F Liu","year":"2013","unstructured":"Liu Y-F, Liu S-Y (2013) A hybrid discrete articial bee colony algorithm for per- mutation owshop scheduling problem. Appl Soft Comput 13(3):1459\u20131463","journal-title":"Appl Soft Comput"},{"issue":"1","key":"5673_CR44","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/TSMCB.2006.883272","volume":"37","author":"B Liu","year":"2007","unstructured":"Liu B, Wang L, Jin Y-H (2007) An effective pso-based memetic algorithm for ow shop scheduling. IEEE Trans Sys Man Cybern Part B Cybern 37(1):18\u201327","journal-title":"IEEE Trans Sys Man Cybern Part B Cybern"},{"key":"5673_CR45","doi-asserted-by":"crossref","first-page":"2791","DOI":"10.1016\/j.cor.2006.12.013","volume":"35","author":"B Liu","year":"2008","unstructured":"Liu B, Wang L, Jin YH (2008) An effective hybrid PSO-based algorithm for ow shop scheduling with limited buffers. Comput Oper Res 35:2791\u20132806","journal-title":"Comput Oper Res"},{"key":"5673_CR46","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.amc.2014.09.010","volume":"248","author":"Y Liu","year":"2014","unstructured":"Liu Y, Yin M, Gu W (2014) An effective differential evolution algorithm for permutation ow shop scheduling problem. Appl Math Comput 248:143\u2013159","journal-title":"Appl Math Comput"},{"key":"5673_CR47","doi-asserted-by":"publisher","unstructured":"\u0141ukasik S\u017bak S (2009) Firefly algorithm for continuous constrained optimization tasks. In: Nguyen NT, Kowalczyk R, Chen SM (eds) Computational collective intelligence. Semantic Web, Social Networks and Multiagent Systems. ICCCI 2009. Lecture Notes in Computer Science, vol 5796. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-04441-08","DOI":"10.1007\/978-3-642-04441-08"},{"issue":"4","key":"5673_CR48","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1504\/IJBIC.2012.048061","volume":"4","author":"MK Marichelvam","year":"2012","unstructured":"Marichelvam MK (2012) An improved hybrid cuckoo search (ihcs) metaheuristics algorithm for permutation ow shop scheduling problems. Int J Bio-Inspired Comput 4(4):200\u2013205","journal-title":"Int J Bio-Inspired Comput"},{"key":"5673_CR49","doi-asserted-by":"publisher","unstructured":"Miller-Todd J, Steinh\u00f6fel K, Veenstra P (2018) Firefly-inspired algorithm for job shop scheduling. In: B\u00f6ckenhauer HJ., Komm D., Unger W. (eds) Adventures Between Lower Bounds and Higher Altitudes. Lecture Notes in Computer Science, vol 11011. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-98355-424","DOI":"10.1007\/978-3-319-98355-424"},{"issue":"1","key":"5673_CR50","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.cie.2007.11.018","volume":"55","author":"MS Nagano","year":"2008","unstructured":"Nagano MS, Ruiz R, Lorena LAN (2008) A constructive genetic algorithm for permutation owshop scheduling. Comput Ind Eng 55(1):195\u2013207","journal-title":"Comput Ind Eng"},{"key":"5673_CR51","doi-asserted-by":"publisher","first-page":"16679","DOI":"10.1007\/s00500-020-05059-4","volume":"24","author":"G Nagaraj","year":"2020","unstructured":"Nagaraj G, Arunachalam M, Vinayagar K, Paramasamy S (2020) Enhancing performance of cell formation problem using hybrid efficient swarm optimization. Soft Comput 24:16679\u201316690. https:\/\/doi.org\/10.1007\/s00500-020-05059-4","journal-title":"Soft Comput"},{"issue":"1","key":"5673_CR52","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M, Enscore E, Ham I (1983) A heuristic algorithm for the m-machine, n-job owshop sequencing problem. OMEGA Int J Manage Sci 11(1):91\u201395","journal-title":"OMEGA Int J Manage Sci"},{"issue":"2","key":"5673_CR53","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1016\/j.ejor.2004.08.021","volume":"169","author":"E Nowicki","year":"2006","unstructured":"Nowicki E, Smutnicki C (2006) Some aspects of scatter search in the ow-shop problem. Eur J Oper Res 169(2):654\u2013666","journal-title":"Eur J Oper Res"},{"key":"5673_CR54","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","volume":"91","author":"C NowickiE Smutnicki","year":"1996","unstructured":"NowickiE Smutnicki C (1996) A fast tabu search algorithm for the permutation owshop problem. Eur J Oper Res 91:160\u2013175","journal-title":"Eur J Oper Res"},{"issue":"2","key":"5673_CR55","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1016\/j.ejor.2004.08.043","volume":"171","author":"G Onwubolu","year":"2006","unstructured":"Onwubolu G, Davendra D (2006) Scheduling ow shops using differential evolution algorithm. Eur J Oper Res 171(2):674\u2013692","journal-title":"Eur J Oper Res"},{"key":"5673_CR56","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","volume":"17","author":"I Osman","year":"1989","unstructured":"Osman I, Potts C (1989) Simulated annealing for permutation ow shop scheduling. Omega 17:551\u2013557","journal-title":"Omega"},{"issue":"2","key":"5673_CR57","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1111\/j.2517-6161.1961.tb00432.x","volume":"23","author":"ES Page","year":"1961","unstructured":"Page ES (1961) An approach to the scheduling of jobs on machines. J Royal Stat Soc Ser B Methodol 23(2):484\u2013492","journal-title":"J Royal Stat Soc Ser B Methodol"},{"issue":"1","key":"5673_CR58","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1057\/jors.1965.8","volume":"16","author":"D Palmer","year":"1965","unstructured":"Palmer D (1965) Sequencing jobs through a multi-stage process in the minimum total time\u2014a quick method of obtaining a near optimum. Oper Res Quarterly 16(1):101\u2013107","journal-title":"Oper Res Quarterly"},{"key":"5673_CR59","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1016\/j.cie.2008.03.003","volume":"55","author":"QK Pan","year":"2008","unstructured":"Pan QK, Tasgetiren MF, Liang YC (2008) A discrete differential evolution algorithm for the permutation ow shop scheduling problem. Comput Ind Eng 55:795\u2013816","journal-title":"Comput Ind Eng"},{"key":"5673_CR60","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1016\/j.ins.2010.10.009","volume":"181","author":"QK Pan","year":"2011","unstructured":"Pan QK, Wang L, Gao L, Li WD (2011) An effective hybrid discrete differential evolution algorithm for the ow shop scheduling with intermediate buffers. Inf Sci 181:668\u2013685","journal-title":"Inf Sci"},{"key":"5673_CR61","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.omega.2013.12.004","volume":"45","author":"Q-K Pan","year":"2014","unstructured":"Pan Q-K, Wang L, Li J-Q, Duan J-H (2014) A novel discrete articial bee colony algorithm for the hybrid owshop scheduling problem with makespan minimisation. Omega 45:42\u201356","journal-title":"Omega"},{"key":"5673_CR62","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling: Theory, algorithms and systems","author":"ML Pinedo","year":"2012","unstructured":"Pinedo ML (2012) Scheduling: Theory, algorithms and systems, 2nd edn. Springer, New York. https:\/\/doi.org\/10.1007\/978-1-4614-2361-4","edition":"2"},{"issue":"2","key":"5673_CR63","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1016\/S0377-2217(02)00908-6","volume":"155","author":"C Rajendran","year":"2004","unstructured":"Rajendran C, Ziegler H (2004) Ant-colony algorithms for permutation owshop scheduling to minimize makespan\/total owtime of jobs. Eur J Oper Res 155(2):426\u2013438","journal-title":"Eur J Oper Res"},{"key":"5673_CR64","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"CR Reeves","year":"1995","unstructured":"Reeves CR (1995) A genetic algorithm for owshop sequencing. Comput Oper Res 22:5\u201313","journal-title":"Comput Oper Res"},{"key":"5673_CR65","unstructured":"Rossi FL, Nagano MS, Neto RFT (2016) Evaluation of high performance con- structive heuristics for the ow shop with makespan minimization. Int J Adv Manuf Technol, pp 1\u201312"},{"key":"5673_CR66","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.omega.2018.03.004","volume":"83","author":"R Rub\u00e9n","year":"2019","unstructured":"Rub\u00e9n R, Quan-Ke P, Bahman N (2019) Iterated Greedy methods for the distributed permutation flowshop scheduling problem. Omega 83:213\u2013222","journal-title":"Omega"},{"issue":"3","key":"5673_CR67","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R Ruiz","year":"2007","unstructured":"Ruiz R, St\u00fctzle T (2007) A simple and effective iterated greedy algorithm for the permutation owshop scheduling problem. Eur J Oper Res 177(3):2033\u20132049","journal-title":"Eur J Oper Res"},{"issue":"5","key":"5673_CR68","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/j.omega.2004.12.006","volume":"34","author":"R Ruiz","year":"2006","unstructured":"Ruiz R, Maroto C, Alcaraz J (2006) Two new robust genetic algorithms for the owshop scheduling problem. Omega 34(5):461\u2013476","journal-title":"Omega"},{"key":"5673_CR69","doi-asserted-by":"crossref","first-page":"3938","DOI":"10.3923\/jas.2008.3938.3944","volume":"8","author":"SJ Sadjadi","year":"2008","unstructured":"Sadjadi SJ, Bouquard JL, Ziaee M (2008) An ant colony algorithm for the owshop scheduling problem. J Appl Sci 8:3938\u201344","journal-title":"J Appl Sci"},{"key":"5673_CR70","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.asoc.2014.11.022","volume":"28","author":"A Sana","year":"2015","unstructured":"Sana A, Javad R (2015) Minimizing makespan for ow shop scheduling problem with intermediate buffers by using hybrid approach of articial immune system. Appl Soft Comput 28:44\u201356. https:\/\/doi.org\/10.1016\/j.asoc.2014.11.022","journal-title":"Appl Soft Comput"},{"key":"5673_CR71","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-014-1597-x","author":"S Saremi","year":"2014","unstructured":"Saremi S, Mirjalili S, Lewis A (2014) Biogeography-based optimisation with chaos. Neural Comput Appl. https:\/\/doi.org\/10.1007\/s00521-014-1597-x","journal-title":"Neural Comput Appl"},{"key":"5673_CR72","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.eswa.2015.12.001","volume":"51","author":"W Shao","year":"2016","unstructured":"Shao W, Pi D (2016) A self-guided differential evolution with neighborhood search for permutation ow shop scheduling. Expert Syst Appl 51:161\u2013176","journal-title":"Expert Syst Appl"},{"key":"5673_CR73","doi-asserted-by":"publisher","unstructured":"Suyanto Jati GK (2011) Evolutionary discrete firefly algorithm for travelling salesman problem. In: Bouchachia A. (eds) Adaptive and intelligent systems. ICAIS 2011. Lecture Notes in Computer Science, 6943:393\u2013403. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-23857-438","DOI":"10.1007\/978-3-642-23857-438"},{"issue":"2","key":"5673_CR74","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278\u2013285","journal-title":"Eur J Oper Res"},{"issue":"22","key":"5673_CR75","doi-asserted-by":"crossref","first-page":"4737","DOI":"10.1080\/00207540600620849","volume":"44","author":"MF Tasgetiren","year":"2006","unstructured":"Tasgetiren MF, Liang Y-C, Sevkli M, Gencyilmaz G (2006) Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem. Int J Prod Res 44(22):4737\u20134754","journal-title":"Int J Prod Res"},{"issue":"3","key":"5673_CR76","doi-asserted-by":"crossref","first-page":"1930","DOI":"10.1016\/j.ejor.2005.12.024","volume":"177","author":"MF Tasgetiren","year":"2007","unstructured":"Tasgetiren MF, Liang Y-C, Sevkli M, Gencyilmaz G (2007) A particle swarm optimization algorithm for makespan and total owtime minimization in the permutation owshop sequencing problem. Eur J Oper Res 177(3):1930\u20131947","journal-title":"Eur J Oper Res"},{"issue":"2","key":"5673_CR77","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/j.ejor.2007.11.049","volume":"193","author":"E Vallada","year":"2009","unstructured":"Vallada E, Ruiz R (2009) Cooperative metaheuristics for the permutation owshop scheduling problem. Eur J Oper Res 193(2):365\u2013376","journal-title":"Eur J Oper Res"},{"key":"5673_CR78","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jmsy.2014.11.011","volume":"35","author":"D Vasiljevic","year":"2015","unstructured":"Vasiljevic D, Danilovic M (2015) Handling ties in heuristics for the permutation ow shop scheduling problem. J Manuf Syst 35:1\u20139","journal-title":"J Manuf Syst"},{"key":"5673_CR79","doi-asserted-by":"crossref","first-page":"2960","DOI":"10.1016\/j.cor.2005.02.028","volume":"33","author":"L Wang","year":"2006","unstructured":"Wang L, Zhang L, Zheng DZ (2006) An effective hybrid genetic algorithm for ow shop scheduling with limited buffers. Comput Oper Res 33:2960\u20132971","journal-title":"Comput Oper Res"},{"key":"5673_CR80","doi-asserted-by":"publisher","unstructured":"Xin GJ, Hai Chen, Y (2009) A particle swarm optimizer with multi-stagelinearly-decreasing inertia weight. In: Proc. 2009 Int. Jt. Conf. Comput. Sci.Optim., CSO 2009, pp 505\u2013508. https:\/\/doi.org\/10.1109\/CSO.2009.420","DOI":"10.1109\/CSO.2009.420"},{"key":"5673_CR81","unstructured":"Yang X-S, Deb S (2009) Cuckoo search via L\u00e9vy ights. In: World congress on nature and biologically inspired computing IEEE, pp 210\u2013214"},{"key":"5673_CR82","unstructured":"Yang XS (2008) Nature-inspired metaheuristic algorithms. Luniver Press, ISBN 978-1-905986-10-1"},{"key":"5673_CR83","first-page":"739","volume":"33","author":"K-C Ying","year":"2007","unstructured":"Ying K-C, Lin S-W (2007) Multi-heuristic desirability ant colony system heuristic for non-permutation owshop scheduling problems. Int J Adv Manuf Technol 33:739\u2013802","journal-title":"Int J Adv Manuf Technol"},{"issue":"2","key":"5673_CR84","first-page":"155","volume":"33","author":"A Yousif","year":"2011","unstructured":"Yousif A, Abdullah AH, Nor SM, Abdelaziz AA (2011) Scheduling jobs on grid computing using firefly algorithm. J Theor Appl Inf Technol 33(2):155\u2013164","journal-title":"J Theor Appl Inf Technol"},{"issue":"1","key":"5673_CR85","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/j.cor.2006.02.024","volume":"35","author":"CY Zhang","year":"2008","unstructured":"Zhang CY, Li P, Rao Y, Guan Z (2008) A very fast TS\/SA algorithm for the job shop scheduling problem. Comput Oper Res 35(1):282\u2013294","journal-title":"Comput Oper Res"},{"issue":"1","key":"5673_CR86","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cie.2009.01.016","volume":"58","author":"C Zhang","year":"2010","unstructured":"Zhang C, Ning J, Ouyang D (2010a) A hybrid alternate two phases particle swarm optimization algorithm for ow shop scheduling problem. Comput Ind Eng 58(1):1\u201311","journal-title":"Comput Ind Eng"},{"issue":"8","key":"5673_CR87","doi-asserted-by":"crossref","first-page":"5827","DOI":"10.1016\/j.eswa.2010.02.024","volume":"37","author":"J Zhang","year":"2010","unstructured":"Zhang J, Zhang C, Liang S (2010b) The circular discrete particle swarm optimization algorithm for ow shop scheduling problem. Expert Syst Appl 37(8):5827\u20135834","journal-title":"Expert Syst Appl"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-05673-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-05673-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-05673-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T20:31:51Z","timestamp":1724617911000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-05673-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,11]]},"references-count":87,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["5673"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-05673-w","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,11]]},"assertion":[{"value":"8 February 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"All of the authors declares that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}