{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:55:09Z","timestamp":1761897309889,"version":"3.37.3"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,6,16]],"date-time":"2020-06-16T00:00:00Z","timestamp":1592265600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,6,16]],"date-time":"2020-06-16T00:00:00Z","timestamp":1592265600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2021,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The open shop scheduling problem involves a set of activities that should be run on a limited set of machines. The purpose of scheduling open shops problem is to provide a timetable for implementation of the entire operation so that the total execution time is reduced. The tasks scheduling problem in open shops is important in many applications due to the arbitrariness of the processing sequence of each job and lack of a prioritization of its operations. This is an NP-hard problem and obtaining an optimal solution to this problem requires a high time complexity. Therefore, heuristic techniques are used to solve these problems. In this paper, we investigate the tasks scheduling problem in open shops using the Bat Algorithm (BA) based on ColReuse and substitution meta-heuristic functions. The heuristic functions are designed to increase the rate of convergence to the optimal solution. To evaluate the performance of the proposed algorithm, standard open shop benchmarks were used. The results obtained in each benchmark are compared with those of the previous methods. Finally, after analyzing the results, it was found that the proposed BA had a better performance and was able to generate the best solution in all cases.<\/jats:p>","DOI":"10.1007\/s00521-020-05055-7","type":"journal-article","created":{"date-parts":[[2020,6,17]],"date-time":"2020-06-17T13:03:46Z","timestamp":1592399026000},"page":"1559-1573","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["An improved bat optimization algorithm to solve the tasks scheduling problem in open shop"],"prefix":"10.1007","volume":"33","author":[{"given":"Morteza Babazadeh","family":"Shareh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shirin Hatami","family":"Bargh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali Asghar Rahmani","family":"Hosseinabadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2542-9842","authenticated-orcid":false,"given":"Adam","family":"Slowik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,16]]},"reference":[{"key":"5055_CR1","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","volume":"174","author":"X Li","year":"2016","unstructured":"Li X, Gao L (2016) An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int J Prod Econ 174:93\u2013110","journal-title":"Int J Prod Econ"},{"key":"5055_CR2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.dam.2017.04.031","volume":"227","author":"NEH Tellache","year":"2017","unstructured":"Tellache NEH, Boudhar M (2017) Open shop scheduling problems with conflict graphs. Discr Appl Math 227:103\u2013120","journal-title":"Discr Appl Math"},{"issue":"2","key":"5055_CR3","first-page":"59","volume":"3","author":"S Noori-Darvish","year":"2011","unstructured":"Noori-Darvish S, Tavakkoli-Moghaddam R (2011) Solving a bi-objective open shop scheduling problem with fuzzy parameters. J Appl Oper Res 3(2):59\u201374","journal-title":"J Appl Oper Res"},{"issue":"12","key":"5055_CR4","doi-asserted-by":"crossref","first-page":"1272","DOI":"10.1016\/j.ifacol.2016.07.690","volume":"49","author":"GC Ciro","year":"2016","unstructured":"Ciro GC, Dugardin F, Yalaoui F, Kelly R (2016) A NSGA-II and NSGA-III comparison for solving an open shop scheduling problem with resource constraints. IFAC-PapersOnLine 49(12):1272\u20131277","journal-title":"IFAC-PapersOnLine"},{"key":"5055_CR5","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1016\/j.ijpe.2007.01.005","volume":"111","author":"H TsoLin","year":"2008","unstructured":"TsoLin H, TauLee H, Pan W (2008) Heuristics for scheduling in a no-wait open shop with movable dedicated machines. Int J Prod Econ 111:368\u2013377","journal-title":"Int J Prod Econ"},{"issue":"1","key":"5055_CR6","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1007\/s10479-015-1855-z","volume":"229","author":"S Shamshirband","year":"2015","unstructured":"Shamshirband S, Shojafar M, Hosseinabadi AR, Kardgar M, Nasir MN, Ahmad R (2015) OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises. Ann Oper Res 229(1):743\u2013758","journal-title":"Ann Oper Res"},{"issue":"4","key":"5055_CR7","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T Gonzalez","year":"1976","unstructured":"Gonzalez T, Sahni S (1976) Open shop scheduling to minimize finish time. J ACM (JACM) 23(4):665\u2013679","journal-title":"J ACM (JACM)"},{"issue":"4","key":"5055_CR8","first-page":"89","volume":"29","author":"W Kubiak","year":"1991","unstructured":"Kubiak W, Sriskandarajah C, Zaras K (1991) A note on the complexity of openshop scheduling problems. INFOR Inf Syst Oper Res 29(4):89\u2013294","journal-title":"INFOR Inf Syst Oper Res"},{"issue":"3","key":"5055_CR9","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0305-0548(87)90029-3","volume":"14","author":"CY Liu","year":"1987","unstructured":"Liu CY, Bulfin RL (1987) Scheduling ordered open shops. Comput Oper Res 14(3):257\u2013264","journal-title":"Comput Oper Res"},{"issue":"6","key":"5055_CR10","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1057\/jors.1994.99","volume":"45","author":"C Prins","year":"1994","unstructured":"Prins C (1994) An overview of scheduling problems arising in satellite communications. J Oper Res Soc 45(6):611\u2013623","journal-title":"J Oper Res Soc"},{"key":"5055_CR11","volume-title":"Scheduling algorithms","author":"P Brucker","year":"2007","unstructured":"Brucker P (2007) Scheduling algorithms. Springer, Berlin"},{"issue":"5","key":"5055_CR12","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1002\/nav.20231","volume":"54","author":"AW Kolen","year":"2007","unstructured":"Kolen AW, Lenstra JK, Papadimitriou CH, Spieksma FC (2007) Interval scheduling: a survey. Nav Res Logist (NRL) 54(5):530\u2013543","journal-title":"Nav Res Logist (NRL)"},{"key":"5055_CR13","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.measurement.2017.09.022","volume":"114","author":"MS Reddy","year":"2018","unstructured":"Reddy MS, Ratnam C, Rajyalakshmi G, Manupati VK (2018) An effective hybrid multi objective evolutionary algorithm for solving real time event in flexible job shop scheduling problem. Measurement 114:78\u201390","journal-title":"Measurement"},{"issue":"1","key":"5055_CR14","first-page":"745","volume":"10","author":"AAR Hosseinabadi","year":"2013","unstructured":"Hosseinabadi AAR, Farahabadi AB, Rostami MHS, Lateran AF (2013) Presentation of a new and beneficial method through problem solving timing of open shop by random algorithm gravitational emulation local search. Int J Comput Sci Issues (IJCSI) 10(1):745\u2013751","journal-title":"Int J Comput Sci Issues (IJCSI)"},{"issue":"11","key":"5055_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.17485\/ijst\/2015\/v8i11\/71761","volume":"8","author":"H Tavakkolai","year":"2015","unstructured":"Tavakkolai H, Hosseinabadi AAR, Yadollahi M, Mohammadpour T (2015) Using gravitational search algorithm for in advance reservation of resources in solving the scheduling problem of works in workflow workshop environment. Indian J Sci Technol 8(11):1\u201316","journal-title":"Indian J Sci Technol"},{"issue":"9","key":"5055_CR16","first-page":"1870","volume":"4","author":"AB Farahabadi","year":"2013","unstructured":"Farahabadi AB, Hosseinabadi AR (2013) Present a new hybrid algorithm scheduling flexible manufacturing system consideration cost maintenance. Int J Sci Eng Res 4(9):1870\u20131875","journal-title":"Int J Sci Eng Res"},{"key":"5055_CR17","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"RG Michael","year":"1979","unstructured":"Michael RG, David SJ (1979) Computers and intractability: a guide to the theory of NP-completeness. WH Free. Co., San Francisco"},{"issue":"3","key":"5055_CR18","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1016\/j.ifacol.2015.06.167","volume":"48","author":"GC Ciro","year":"2015","unstructured":"Ciro GC, Dugardin F, Yalaoui F, Kelly R (2015) A fuzzy ant colony optimization to solve an open shop scheduling problem with multi-skills resource constraints. IFAC-PapersOnLine 48(3):715\u2013720","journal-title":"IFAC-PapersOnLine"},{"issue":"2","key":"5055_CR19","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF02684434","volume":"58","author":"T Tautenhahn","year":"1997","unstructured":"Tautenhahn T, Woeginger GJ (1997) Unit-time scheduling problems with time dependent resources. Computing 58(2):97\u2013111","journal-title":"Computing"},{"issue":"3","key":"5055_CR20","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1016\/j.ejor.2007.02.057","volume":"189","author":"H Brasel","year":"2008","unstructured":"Brasel H, Herms A, Morig M, Tautenhahn T, Tusch J, Werner F (2008) Heuristic constructive algorithms for open shop scheduling to minimize mean flow time. Eur J Oper Res 189(3):856\u2013870","journal-title":"Eur J Oper Res"},{"issue":"2","key":"5055_CR21","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF02568554","volume":"5","author":"D Alcaide","year":"1997","unstructured":"Alcaide D, Sicilia J, Vigo D (1997) A tabu search algorithm for the open shop problem. Top 5(2):283\u2013296","journal-title":"Top"},{"issue":"1","key":"5055_CR22","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/S0377-2217(99)00168-X","volume":"124","author":"CF Liaw","year":"2000","unstructured":"Liaw CF (2000) A hybrid genetic algorithm for the open shop scheduling problem. Eur J Oper Res 124(1):28\u201342","journal-title":"Eur J Oper Res"},{"issue":"6","key":"5055_CR23","doi-asserted-by":"crossref","first-page":"1565","DOI":"10.1016\/j.cor.2003.11.018","volume":"32","author":"C Blum","year":"2005","unstructured":"Blum C (2005) Beam-ACO-Hybridizing ant colony optimization with beam search: an application to open shop scheduling. Comput Oper Res 32(6):1565\u20131591","journal-title":"Comput Oper Res"},{"issue":"5","key":"5055_CR24","doi-asserted-by":"crossref","first-page":"5438","DOI":"10.1016\/j.eswa.2010.10.010","volume":"38","author":"YM Huang","year":"2011","unstructured":"Huang YM, Lin JC (2011) A new bee colony optimization algorithm with idle-time-based filtering scheme for open shop-scheduling problems. Exp Syst Appl 38(5):5438\u20135447","journal-title":"Exp Syst Appl"},{"issue":"5\u20138","key":"5055_CR25","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1007\/s00170-011-3825-1","volume":"62","author":"F Ahmadizar","year":"2012","unstructured":"Ahmadizar F, Farahani MH (2012) A novel hybrid genetic algorithm for the open shop scheduling problem. Int J Adv Manuf Technol 62(5\u20138):775\u2013787","journal-title":"Int J Adv Manuf Technol"},{"issue":"7","key":"5055_CR26","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.ipl.2013.01.009","volume":"113","author":"Y Chen","year":"2013","unstructured":"Chen Y, Zhang A, Chen G, Dong J (2013) Approximation algorithms for parallel open shop scheduling. Inf Process Lett 113(7):220\u2013224","journal-title":"Inf Process Lett"},{"key":"5055_CR27","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/j.ijpe.2014.06.011","volume":"158","author":"B Naderi","year":"2014","unstructured":"Naderi B, Zandieh M (2014) Modeling and scheduling no-wait open shop problems. Int J Prod Econ 158:256\u2013266","journal-title":"Int J Prod Econ"},{"key":"5055_CR28","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.cor.2015.10.012","volume":"67","author":"D Bai","year":"2016","unstructured":"Bai D, Zhang ZH, Zhang Q (2016) Flexible open shop scheduling problem to minimize makespan. Comput Oper Res 67:207\u2013215","journal-title":"Comput Oper Res"},{"key":"5055_CR29","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.procir.2017.03.138","volume":"63","author":"Y Tanimizu","year":"2017","unstructured":"Tanimizu Y, Sakamoto M, Nonomiya H (2017) A co-evolutionary algorithm for open-shop scheduling with disassembly operations. Procedia CIRP 63:289\u2013294","journal-title":"Procedia CIRP"},{"key":"5055_CR30","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.eswa.2016.07.046","volume":"65","author":"KZ Gao","year":"2016","unstructured":"Gao KZ, Suganthan PN, Pan QK, Chua TJ, Chong CS, Cai TX (2016) An improved artificial bee colony algorithm for flexible job-shop scheduling problem with fuzzy processing time. Exp Syst Appl 65:52\u201367","journal-title":"Exp Syst Appl"},{"key":"5055_CR31","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.eswa.2017.09.028","volume":"91","author":"F Zhao","year":"2018","unstructured":"Zhao F, Liu H, Zhang Y, Ma W, Zhang C (2018) A discrete water wave optimization algorithm for no-wait flow shop scheduling problem. Exp Syst Appl 91:347\u2013363","journal-title":"Exp Syst Appl"},{"issue":"1","key":"5055_CR32","first-page":"15","volume":"5","author":"MK Marichelvam","year":"2013","unstructured":"Marichelvam MK, Prabaharan T, Yang XS, Geetha M (2013) Solving hybrid flow shop scheduling problems using bat algorithm. Int J Logist Econ Glob 5(1):15\u201329","journal-title":"Int J Logist Econ Glob"},{"issue":"1","key":"5055_CR33","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s10479-013-1446-9","volume":"211","author":"A Oulamara","year":"2013","unstructured":"Oulamara A, Rebaine D, Serairi M (2013) Scheduling the two-machine open shop problem under resource constraints for setting the jobs. Ann Oper Res 211(1):333\u2013356","journal-title":"Ann Oper Res"},{"issue":"5","key":"5055_CR34","first-page":"24","volume":"164","author":"H Zaher","year":"2017","unstructured":"Zaher H, Ragaa N, Sayed H (2017) A novel improved bat algorithm for job shop scheduling problem. Int J Comput Appl 164(5):24\u201330","journal-title":"Int J Comput Appl"},{"issue":"23","key":"5055_CR35","doi-asserted-by":"crossref","first-page":"9603","DOI":"10.1016\/j.apm.2013.05.002","volume":"37","author":"SM Goldansaz","year":"2013","unstructured":"Goldansaz SM, Jolai F, Anaraki AHZ (2013) A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop. Appl Math Model 37(23):9603\u20139616","journal-title":"Appl Math Model"},{"issue":"1","key":"5055_CR36","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ejor.2014.11.037","volume":"243","author":"C Koulamas","year":"2015","unstructured":"Koulamas C, Kyparisis GJ (2015) The three-machine proportionate open shop and mixed shop minimum makespan problems. Eur J Oper Res 243(1):70\u201374","journal-title":"Eur J Oper Res"},{"issue":"2","key":"5055_CR37","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/j.rcim.2007.07.017","volume":"25","author":"C Low","year":"2009","unstructured":"Low C, Yeh Y (2009) Genetic algorithm-based heuristics for an open shop scheduling problem with setup, processing, and removal times separated. Robot Comput Integr Manuf 25(2):314\u2013322","journal-title":"Robot Comput Integr Manuf"},{"key":"5055_CR38","first-page":"238","volume":"230","author":"ZH Zhang","year":"2014","unstructured":"Zhang ZH, Bai D (2014) An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times. Appl Math Comput 230:238\u2013247","journal-title":"Appl Math Comput"},{"key":"5055_CR39","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.tcs.2019.09.046","volume":"803","author":"Y Chen","year":"2020","unstructured":"Chen Y, Goebel R, Lin G, Su B, Zhang A (2020) Open-shop scheduling for unit jobs under precedence constraints. Theor Comput Sci 803:144\u2013151","journal-title":"Theor Comput Sci"},{"key":"5055_CR40","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.ins.2017.04.042","volume":"408","author":"W Wei","year":"2017","unstructured":"Wei W, Song H, Li W, Shen P, Vasilakos A (2017) Gradient-driven parking navigation using a continuous information potential field based on wireless sensor network. Inf Sci 408:100\u2013114","journal-title":"Inf Sci"},{"issue":"2","key":"5055_CR41","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/j.ejor.2020.02.010","volume":"285","author":"G Mej\u00eda","year":"2020","unstructured":"Mej\u00eda G, Yuraszeck F (2020) A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel\/setup times. Eur J Oper Res 285(2):484\u2013496","journal-title":"Eur J Oper Res"},{"issue":"11","key":"5055_CR42","doi-asserted-by":"crossref","first-page":"3013","DOI":"10.1002\/dac.2522","volume":"27","author":"W Wei","year":"2014","unstructured":"Wei W, Xu Q, Wang L, Hei XH, Shen P, Shi W, Shan L (2014) GI\/Geom\/1 queue based on communication model for mesh networks. Int J Commun Syst 27(11):3013\u20133029","journal-title":"Int J Commun Syst"},{"key":"5055_CR43","doi-asserted-by":"crossref","first-page":"106292","DOI":"10.1016\/j.cie.2020.106292","volume":"141","author":"TF Abdelmaguid","year":"2020","unstructured":"Abdelmaguid TF (2020) Scatter search with path relinking for multiprocessor open shop scheduling. Comput Ind Eng 141:106292","journal-title":"Comput Ind Eng"},{"key":"5055_CR44","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.patcog.2019.03.009","volume":"92","author":"W Wei","year":"2019","unstructured":"Wei W, Zhou B, Polap D, Wozniak M (2019) A regional adaptive variational PDE model for computed tomography image reconstruction. Pattern Recognit 92:64\u201381","journal-title":"Pattern Recognit"},{"key":"5055_CR45","doi-asserted-by":"crossref","unstructured":"Yang XS (2010) A new metaheuristic bat-inspired algorithm. In: Proceedings of the of nature inspired cooperative strategies for optimization (NICSO 2010). Springer, Berlin, Heidelberg, pp 65\u201374","DOI":"10.1007\/978-3-642-12538-6_6"},{"issue":"5","key":"5055_CR46","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1504\/IJBIC.2011.042259","volume":"3","author":"XS Yang","year":"2011","unstructured":"Yang XS (2011) Bat algorithm for multi-objective optimisation. Int J Bio-Inspired Comput 3(5):267\u2013274","journal-title":"Int J Bio-Inspired Comput"},{"issue":"3","key":"5055_CR47","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1504\/IJBIC.2013.055093","volume":"5","author":"XS Yang","year":"2013","unstructured":"Yang XS, He X (2013) Bat algorithm: literature review and applications. Int J Bio-Inspired Comput 5(3):141\u2013149","journal-title":"Int J Bio-Inspired Comput"},{"key":"5055_CR48","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/j.measurement.2016.09.031","volume":"95","author":"V Basetti","year":"2017","unstructured":"Basetti V, Chandel AK (2017) Optimal PMU placement for power system observability using Taguchi binary bat algorithm. Measurement 95:8\u201320","journal-title":"Measurement"},{"key":"5055_CR49","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.eswa.2018.07.036","volume":"114","author":"S Chen","year":"2018","unstructured":"Chen S, Peng GH, He XS, Yang XS (2018) Global convergence analysis of the bat algorithm using a markovian framework and dynamical system theory. Exp Syst Appl 114:173\u2013182","journal-title":"Exp Syst Appl"},{"issue":"2","key":"5055_CR50","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"},{"key":"5055_CR51","doi-asserted-by":"crossref","unstructured":"Harmanani HM, Ghosn SB (2016) An efficient method for the open-shop scheduling problem using simulated annealing. In: Information technology: new generations. Springer, Cham, pp 1183\u20131193","DOI":"10.1007\/978-3-319-32467-8_102"},{"key":"5055_CR52","doi-asserted-by":"crossref","unstructured":"Khuri S, Miryala SR (1999) Genetic algorithms for solving open shop scheduling problems. In: Proceedings of the of Portuguese conference on artificial intelligence. Springer, Berlin, Heidelberg, pp 357\u2013368","DOI":"10.1007\/3-540-48159-1_25"},{"key":"5055_CR53","unstructured":"Ross HLFP, Corne D (1994) A promising hybrid GA\/heuristic approach for open-shop scheduling problems. In: Proceedings of the 11th European conference on artificial intelligence, pp 590\u2013594"},{"issue":"3","key":"5055_CR54","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s001860000090","volume":"52","author":"C Prins","year":"2000","unstructured":"Prins C (2000) Competitive genetic algorithms for the open-shop scheduling problem. Math Methods Oper Res 52(3):389\u2013411","journal-title":"Math Methods Oper Res"},{"issue":"7","key":"5055_CR55","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1002\/nav.20102","volume":"52","author":"S Colak","year":"2005","unstructured":"Colak S, Agarwal A (2005) Non-greedy heuristics and augmented neural networks for the open-shop scheduling problem. Nav Res Logist (NRL) 52(7):631\u2013644","journal-title":"Nav Res Logist (NRL)"},{"key":"5055_CR56","doi-asserted-by":"crossref","unstructured":"Marrouche W, Harmanani HM (2018) Heuristic approaches for the open-shop scheduling problem. In: Information technology\u2014new generations, pp 691\u2013699","DOI":"10.1007\/978-3-319-77028-4_88"},{"issue":"2","key":"5055_CR57","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s40092-018-0297-z","volume":"15","author":"A Bouzidi","year":"2019","unstructured":"Bouzidi A, Essaid Riffi M, Barkatou M (2019) Cat swarm optimization for solving the open shop scheduling problem. J Ind Eng Int 15(2):367\u2013378","journal-title":"J Ind Eng Int"},{"issue":"13","key":"5055_CR58","doi-asserted-by":"crossref","first-page":"5099","DOI":"10.1007\/s00500-018-3177-y","volume":"23","author":"AAR Hosseinabadi","year":"2019","unstructured":"Hosseinabadi AAR, Vahidi J, Saemi B, Sangaiah AK, Elhoseny M (2019) Extended genetic algorithm for solving open-shop scheduling problem. Soft Comput 23(13):5099\u20135116","journal-title":"Soft Comput"},{"key":"5055_CR59","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/978-94-015-7744-1_2","volume-title":"Simulated annealing: theory and applications","author":"PJ Van Laarhoven","year":"1987","unstructured":"Van Laarhoven PJ, Aarts EH (1987) Simulated annealing. In: Aarts EHL (ed) Simulated annealing: theory and applications. Springer, Dordrecht, pp 7\u201315"},{"key":"5055_CR60","doi-asserted-by":"crossref","first-page":"2093","DOI":"10.1007\/978-1-4613-0303-9_33","volume-title":"Handbook of combinatorial optimization","author":"F Glover","year":"1998","unstructured":"Glover F, Laguna M (1998) Tabu search. In: Pardalos PM, Du DZ, Graham RL (eds) Handbook of combinatorial optimization. Springer, Boston, pp 2093\u20132229"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-05055-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-020-05055-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-05055-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T20:38:22Z","timestamp":1723063102000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-020-05055-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,16]]},"references-count":60,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["5055"],"URL":"https:\/\/doi.org\/10.1007\/s00521-020-05055-7","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2020,6,16]]},"assertion":[{"value":"14 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2020","order":3,"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":"In the present work, we have not used any material from previously published. So we have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}