{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T00:35:30Z","timestamp":1774485330204,"version":"3.50.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2018,4,7]],"date-time":"2018-04-07T00:00:00Z","timestamp":1523059200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s00500-018-3177-y","type":"journal-article","created":{"date-parts":[[2018,4,7]],"date-time":"2018-04-07T16:30:55Z","timestamp":1523118655000},"page":"5099-5116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":152,"title":["Extended Genetic Algorithm for solving open-shop scheduling problem"],"prefix":"10.1007","volume":"23","author":[{"given":"Ali Asghar","family":"Rahmani Hosseinabadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javad","family":"Vahidi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Behzad","family":"Saemi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0229-2460","authenticated-orcid":false,"given":"Arun Kumar","family":"Sangaiah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Elhoseny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,7]]},"reference":[{"key":"3177_CR1","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1007\/s00170-011-3825-1","volume":"62","author":"F Ahmdizar","year":"2012","unstructured":"Ahmdizar F, Hosseinabadi M (2012) A novel hybrid genetic algorithm for the open-shop scheduling problem. Int J Adv Manuf Technol 62:775\u2013787","journal-title":"Int J Adv Manuf Technol"},{"issue":"3","key":"3177_CR2","first-page":"27","volume":"3","author":"M Alinaghian","year":"2014","unstructured":"Alinaghian M, Amanipour H, Tirkolaee EB (2014) Enhancement of inventory management approaches in vehicle routing-cross docking problems. J Supply Chain Manag Syst 3(3):27\u201334","journal-title":"J Supply Chain Manag Syst"},{"key":"3177_CR3","doi-asserted-by":"publisher","first-page":"1603","DOI":"10.1007\/s00170-015-8069-z","volume":"85","author":"A Azadeh","year":"2016","unstructured":"Azadeh A, Goldansaz SM, Zahedi-Anaraki A (2016) Solving and optimizing a bi-objective open-shop scheduling problem by a modified genetic algorithm. Int J Adv Manuf Technol 85:1603\u20131613","journal-title":"Int J Adv Manuf Technol"},{"issue":"1","key":"3177_CR4","first-page":"61","volume":"3","author":"E Babaee Tirkolaee","year":"2016","unstructured":"Babaee Tirkolaee E, Alinaghian M, Bakhshi Sasi M, Seyyed Esfahani MM (2016) Solving a robust capacitated arc routing problem using a hybrid simulated annealing algorithm: a waste collection application. J Ind Eng Manag Stud 3(1):61\u201376","journal-title":"J Ind Eng Manag Stud"},{"key":"3177_CR5","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1016\/j.apm.2012.04.037","volume":"37","author":"D Bai","year":"2013","unstructured":"Bai D, Tang L (2013) Open shop scheduling problem to minimize makespan with release dates. Appl Math Model 37:2008\u20132015","journal-title":"Appl Math Model"},{"key":"3177_CR6","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.cor.2015.10.012","volume":"67","author":"D Baia","year":"2016","unstructured":"Baia D, Zhang Z, Zhang Q (2016) Flexible open-shop scheduling problem to minimize makespan. Comput Oper Res 67:207\u2013215","journal-title":"Comput Oper Res"},{"key":"3177_CR7","doi-asserted-by":"publisher","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:220\u2013224","journal-title":"Inf Process Lett"},{"key":"3177_CR8","doi-asserted-by":"crossref","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. In: 8th IFAC conference on manufacturing modelling, management and control MIM 2015, vol 48, pp 715\u2013720","DOI":"10.1016\/j.ifacol.2015.06.167"},{"key":"3177_CR9","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. In: 8th IFAC conference on manufacturing modelling, management and control MIM 2016, vol 49, pp 1272\u20131277"},{"key":"3177_CR10","doi-asserted-by":"publisher","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. Naval Res Logist 52:631\u2013644","journal-title":"Naval Res Logist"},{"key":"3177_CR11","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb K, Jain H (2014) An evolutionary many-objective optimization algorithm using reference-point based nondominated sorting approach. IEEE Trans Evol Comput 18:602\u2013622","journal-title":"IEEE Trans Evol Comput"},{"key":"3177_CR12","unstructured":"Fang H-L, Ross P, 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":"9","key":"3177_CR13","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":"3177_CR14","doi-asserted-by":"publisher","first-page":"9603","DOI":"10.1016\/j.apm.2013.05.002","volume":"37","author":"SM Goldansaz","year":"2013","unstructured":"Goldansaz SM, Jolai F, ZahediAnaraki AH (2013) A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open-shop. Appl Math Model 37:9603\u20139616","journal-title":"Appl Math Model"},{"key":"3177_CR15","doi-asserted-by":"publisher","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 Assoc Comput Mach 23:665\u2013679","journal-title":"J Assoc Comput Mach"},{"key":"3177_CR16","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Kan AHG (1979) Optimization and approximation in deterministic machine scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"key":"3177_CR17","first-page":"1183","volume":"448","author":"HM Harmanani","year":"2016","unstructured":"Harmanani HM, Ghosn SB (2016) An efficient method for the open-shop scheduling problem using simulated annealing. Inf Technol New Gener Adv Intell Syst Comput 448:1183\u20131193","journal-title":"Inf Technol New Gener Adv Intell Syst Comput"},{"issue":"10","key":"3177_CR18","first-page":"1387","volume":"16","author":"AR Hosseinabadi","year":"2012","unstructured":"Hosseinabadi AR, Yazdanpanah M, Rostami AS (2012) A new search algorithm for solving symmetric traveling salesman problem based on gravity. World Appl Sci J 16(10):1387\u20131392","journal-title":"World Appl Sci J"},{"issue":"1, No 2","key":"3177_CR19","first-page":"745","volume":"10","author":"AR Hosseinabadi","year":"2013","unstructured":"Hosseinabadi AR, Farahabadi AB, Rostami MS, 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 10(1, No 2):745\u2013752","journal-title":"Int J Comput Sci Issues"},{"key":"3177_CR20","doi-asserted-by":"crossref","unstructured":"Hosseinabadi AR, Kardgar M, Shojafar M, Shamshirband S, Abraham A (2014) GELS-GA: hybrid metaheuristic algorithm for solving multiple travelling salesman problem. In: 14th IEEE ISDA, pp 76\u201381","DOI":"10.1109\/ISDA.2014.7066271"},{"issue":"1","key":"3177_CR21","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10479-014-1770-8","volume":"229","author":"AR Hosseinabadi","year":"2015","unstructured":"Hosseinabadi AR, Siar H, Shamshirband S, Shojafar M, Nizam MH, Nasir M (2015) Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in Small and Medium Enterprises. Ann Oper Res 229(1):451\u2013474","journal-title":"Ann Oper Res"},{"issue":"10","key":"3177_CR22","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1007\/s00521-016-2608-x","volume":"29","author":"AR Hosseinabadi","year":"2016","unstructured":"Hosseinabadi AR, Vahidi J, Balas VE, Mirkamali SS (2016a) OVRP_GELS: solving open vehicle routing problem using the gravitational emulation local search algorithm. Neural Comput Appl 29(10):955\u2013968","journal-title":"Neural Comput Appl"},{"key":"3177_CR23","doi-asserted-by":"crossref","unstructured":"Hosseinabadi AR, Kardgar M, Shojafar M, Shamshirband Sh, Abraham A (2016b) Gravitational search algorithm to solve open vehicle routing problem. In: 6th international conference on innovations in bio-inspired computing and applications (IBICA 2015). Chapter advances in intelligent systems and computing, Kochi, India. Springer, pp 93\u2013103","DOI":"10.1007\/978-3-319-28031-8_8"},{"key":"3177_CR24","unstructured":"Hosseinabadi AR, Alavipour F, Shamshirbnd Sh, Balas VE (2017a) A novel meta-heuristic combinatory method for solving capacitated vehicle location-routing problem with hard time windows. Springer International Publishing Switzerland (2017) Transportation systems, advances in intelligent systems and computing, vol 454. Springer, China, pp 707\u2013728"},{"key":"3177_CR25","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1016\/j.apm.2017.02.042","volume":"49","author":"AR Hosseinabadi","year":"2017","unstructured":"Hosseinabadi AR, Rostami NSH, Kardgar M, Mirkamali SS, Abraham A (2017b) A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm. Appl Math Model 49:663\u2013679","journal-title":"Appl Math Model"},{"key":"3177_CR26","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1504\/IJVD.2017.082593","volume":"73","author":"S Karag\u00f6z","year":"2017","unstructured":"Karag\u00f6z S, Y\u0131ld\u0131z AR (2017) A comparison of recent metaheuristic algorithms for crashworthiness optimisation of vehicle thin-walled tubes considering sheet metal forming effects. Int J Veh Des 73:179\u2013188","journal-title":"Int J Veh Des"},{"key":"3177_CR27","doi-asserted-by":"crossref","unstructured":"Khuri S, Miryala SR (1999) Genetic algorithms for solving open-shop scheduling problems. In: Proceedings of the 9th Portuguese conference on artificial intelligence. Lecture Notes in Computer Science, pp 357\u2013368","DOI":"10.1007\/3-540-48159-1_25"},{"key":"3177_CR28","doi-asserted-by":"publisher","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:70\u201374","journal-title":"Eur J Oper Res"},{"key":"3177_CR29","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume-title":"Handbook in operations research and management science, logistics of production and inventory","author":"EL Lawler","year":"1993","unstructured":"Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (1993) Sequencing and scheduling: algorithms and complexity. In: Graves SC, Rinnooy Kan AHG, Zipkin PH (eds) Handbook in operations research and management science, logistics of production and inventory, 4th edn. North-Holland, Amsterdam, pp 445\u2013522","edition":"4"},{"key":"3177_CR30","doi-asserted-by":"publisher","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:314\u2013322","journal-title":"Robot Comput Integr Manuf"},{"issue":"1","key":"3177_CR31","first-page":"143","volume":"7","author":"SH Mirmohammadi","year":"2017","unstructured":"Mirmohammadi SH, Babaee Tirkolaee E, Goli A, Dehnavi-Arani S (2017) The periodic green vehicle routing problem with considering of time-dependent urban traffic and time windows. Iran Univ Sci Technol 7(1):143\u2013156","journal-title":"Iran Univ Sci Technol"},{"key":"3177_CR32","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:59\u201374","journal-title":"J Appl Oper Res"},{"key":"3177_CR33","volume-title":"Scheduling: theory algorithms and systems","author":"M Pinedo","year":"1995","unstructured":"Pinedo M (1995) Scheduling: theory algorithms and systems. Prentice-Hall, Englewood Cliffs"},{"key":"3177_CR34","doi-asserted-by":"publisher","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:389\u2013411","journal-title":"Math Methods Oper Res"},{"issue":"2","key":"3177_CR35","first-page":"699","volume":"9","author":"AS Rostami","year":"2015","unstructured":"Rostami AS, Mohanna F, Keshavarz H, Hosseinabadi AR (2015) Solving multiple traveling salesman problem using the gravitational emulation local search algorithm. Appl Math Inf Sci 9(2):699\u2013709","journal-title":"Appl Math Inf Sci"},{"issue":"1","key":"3177_CR36","doi-asserted-by":"publisher","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, Nizam MH, Nasir M, Ahmad R (2015a) 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"},{"key":"3177_CR37","doi-asserted-by":"crossref","unstructured":"Shamshirband S, Shojafar M, Hosseinabadi AR, Abraham A (2015b) OVRP_ICA: an imperialist-based optimization algorithm for the open vehicle routing problem. In: International conference on hybrid artificial intelligence systems (HAIS), Chapter Springer LNCS, vol 9121, pp 221\u2013233","DOI":"10.1007\/978-3-319-19644-2_19"},{"key":"3177_CR38","doi-asserted-by":"crossref","unstructured":"Shojafar M, Kardgar M, Hosseinabadi AR, Shamshirband Sh, Abraham A (2016) TETS: a genetic-based scheduler in cloud computing to decrease energy and makespan. In: The 15th international conference on hybrid intelligent systems (HIS 2015), Chapter advances in intelligent systems and computing, vol 420. Seoul, South Korea. Springer, pp 103\u2013115","DOI":"10.1007\/978-3-319-27221-4_9"},{"key":"3177_CR39","doi-asserted-by":"publisher","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:278\u2013285","journal-title":"Eur J Oper Res"},{"key":"3177_CR40","doi-asserted-by":"crossref","unstructured":"Talbi, El-Ghazali (2009) Metaheuristics: from design to impelementation. Wiley, Hoboken. ISBN: 978-0-470-27858-1, 1\u2013624","DOI":"10.1002\/9780470496916"},{"issue":"11","key":"3177_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.17485\/ijst\/2015\/v8i11\/71761","volume":"8","author":"H Tavakkolai","year":"2015","unstructured":"Tavakkolai H, Hosseinabadi AR, 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"},{"key":"3177_CR42","doi-asserted-by":"publisher","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. Discrete Appl Math 227:103\u2013120","journal-title":"Discrete Appl Math"},{"issue":"4","key":"3177_CR43","doi-asserted-by":"publisher","first-page":"417","DOI":"10.3934\/naco.2017026","volume":"7","author":"EB Tirkolaee","year":"2017","unstructured":"Tirkolaee EB, Goli A, Bakhshi M, Mahdavi I (2017) Robust multi-trip vehicle routing problem of perishable products with intermediate depots and time windows. Numer Algebra Control Optim 7(4):417\u2013433","journal-title":"Numer Algebra Control Optim"},{"key":"3177_CR44","doi-asserted-by":"publisher","unstructured":"Tirkolaee EB, Alinaghian A, Hosseinabadi AAR, Sasi MB, Sangaiah AK (2018) An improved ant colony optimization for the multi-trip Capacitated Arc Routing Problem. Comput Electr Eng. ISSN 0045-7906. https:\/\/doi.org\/10.1016\/j.compeleceng.2018.01.040","DOI":"10.1016\/j.compeleceng.2018.01.040"},{"issue":"ISBN13","key":"3177_CR45","first-page":"9781466672581","volume":"1\u2013796","author":"P Vasant","year":"2014","unstructured":"Vasant P (2014) Handbook of research on artificial intelligence techniques and algorithms. IGI Global 1\u2013796(ISBN13):9781466672581","journal-title":"IGI Global"},{"issue":"ISBN13","key":"3177_CR46","first-page":"9781466696440","volume":"1\u2013960","author":"P Vasant","year":"2016","unstructured":"Vasant P, Wilhelm Weber G, Dieu VN (2016) Handbook of research modern optimization algorithms and applications in engineering and economics. IGI Global 1\u2013960(ISBN13):9781466696440","journal-title":"IGI Global"},{"key":"3177_CR47","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.ins.2012.03.005","volume":"210","author":"AR Yildiz","year":"2012","unstructured":"Yildiz AR (2012) A comparative study of population-based optimization algorithms for turning operations. Inf Sci 210:81\u201388","journal-title":"Inf Sci"},{"key":"3177_CR48","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s00158-006-0079-x","volume":"34","author":"AR Y\u0131ld\u0131z","year":"2007","unstructured":"Y\u0131ld\u0131z AR, Ozturk N, Kaya N, Ozturk F (2007) Hybrid multi-objective shape design optimization using Taguchi\u2019s method and genetic algorithm. Struct Multidiscip Optim 34:317\u2013332","journal-title":"Struct Multidiscip Optim"},{"key":"3177_CR49","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/j.amc.2013.12.127","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"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3177-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-018-3177-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3177-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T23:58:34Z","timestamp":1693612714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-018-3177-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,7]]},"references-count":49,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["3177"],"URL":"https:\/\/doi.org\/10.1007\/s00500-018-3177-y","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,7]]},"assertion":[{"value":"7 April 2018","order":1,"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":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}