{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:40:42Z","timestamp":1761896442238},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2016,12,27]],"date-time":"2016-12-27T00:00:00Z","timestamp":1482796800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s00521-016-2789-3","type":"journal-article","created":{"date-parts":[[2016,12,27]],"date-time":"2016-12-27T04:52:04Z","timestamp":1482814324000},"page":"1925-1938","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A simple yet effective grouping evolutionary strategy (GES) algorithm for scheduling parallel machines"],"prefix":"10.1007","volume":"30","author":[{"given":"Ali Husseinzadeh","family":"Kashan","sequence":"first","affiliation":[]},{"given":"Marziehsadat","family":"Keshmiry","sequence":"additional","affiliation":[]},{"given":"Jalil Heidary","family":"Dahooie","sequence":"additional","affiliation":[]},{"given":"Amin","family":"Abbasi-Pooya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,27]]},"reference":[{"key":"2789_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-016-2448-8","author":"SM Abdulhamid","year":"2016","unstructured":"Abdulhamid SM, Abd Latiff MS, Madni SHH, Abdullahi M (2016) Fault tolerance aware scheduling technique for cloud computing environment using dynamic clustering algorithm. Neural Comput Appl. doi: 10.1007\/s00521-016-2448-8","journal-title":"Neural Comput Appl"},{"issue":"1","key":"2789_CR2","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1016\/j.future.2015.08.006","volume":"56","author":"M Abdullahi","year":"2016","unstructured":"Abdullahi M, Ngadi MA, Abdulhamid SM (2016) Symbiotic organism search optimization based task scheduling in cloud computing environment. Future Gener Comput Syst 56(1):640\u2013650","journal-title":"Future Gener Comput Syst"},{"issue":"6","key":"2789_CR3","doi-asserted-by":"crossref","first-page":"6814","DOI":"10.1016\/j.eswa.2010.12.064","volume":"38","author":"S Balin","year":"2011","unstructured":"Balin S (2011) Non-identical parallel machine scheduling using genetic algorithm. Expert Syst Appl 38(6):6814\u20136821","journal-title":"Expert Syst Appl"},{"key":"2789_CR4","doi-asserted-by":"crossref","unstructured":"Bathrinath S, Sankar SS, Ponnambalam SG, Kannan BKV (2013) Bi-objective optimization in identical parallel machine scheduling problem. In: Swarm, evolutionary, and memetic computing. Springer International Publishing, pp. 377\u2013388","DOI":"10.1007\/978-3-319-03753-0_34"},{"key":"2789_CR5","doi-asserted-by":"crossref","unstructured":"Bathrinath S, Sankar SS, Ponnambalam SG, Leno IJ (2015) VNS-based heuristic for identical parallel machine scheduling problem. In: Artificial intelligence and evolutionary algorithms in engineering systems. Springer India, pp 693\u2013699","DOI":"10.1007\/978-81-322-2126-5_74"},{"issue":"2","key":"2789_CR6","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1080\/0305215X.2011.576759","volume":"44","author":"J Chen","year":"2012","unstructured":"Chen J, Pan QK, Wang L, Li JQ (2012) A hybrid dynamic harmony search algorithm for identical parallel machines scheduling. Eng Optim 44(2):209\u2013224","journal-title":"Eng Optim"},{"key":"2789_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"EG Coffman","year":"1978","unstructured":"Coffman EG, Garey MR, Johnson DS (1978) An application of bin-packing to multi-processor scheduling. SIAM J Comput 7:1\u201317","journal-title":"SIAM J Comput"},{"issue":"2","key":"2789_CR8","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1016\/j.ejor.2004.06.002","volume":"160","author":"M Dell\u2019Amico","year":"2005","unstructured":"Dell\u2019Amico M, Martello S (2005) A note on exact algorithms for the identical parallel machine scheduling problem. Eur J Oper Res 160(2):576\u2013578","journal-title":"Eur J Oper Res"},{"issue":"2","key":"2789_CR9","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/ijoc.7.2.191","volume":"7","author":"M Dell\u2019Amico","year":"1995","unstructured":"Dell\u2019Amico M, Martello S (1995) Optimal scheduling of tasks on identical parallel processors. ORSA J Comput 7(2):191\u2013200","journal-title":"ORSA J Comput"},{"key":"2789_CR10","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.neucom.2014.06.091","volume":"163","author":"ROM Diana","year":"2015","unstructured":"Diana ROM, de Fran\u00e7a Filho MF, de Souza SR, de Almeida Vitor JF (2015) An immune-inspired algorithm for an unrelated parallel machines\u2019 scheduling problem with sequence and machine dependent setup-times for makespan minimisation. Neurocomputing 163:94\u2013105","journal-title":"Neurocomputing"},{"key":"2789_CR11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1162\/evco.1994.2.2.123","volume":"2","author":"E Falkenauer","year":"1994","unstructured":"Falkenauer E (1994) New representation and operators for GAs applied to grouping problems. Evol Comput 2:123\u2013144","journal-title":"Evol Comput"},{"key":"2789_CR12","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1080\/095372898233687","volume":"9","author":"SMT Fatemi Ghomi","year":"1998","unstructured":"Fatemi Ghomi SMT, Jolai Ghazvini F (1998) A pairwise interchange algorithm for parallel machine scheduling. Prod Plan Control 9:685\u2013689","journal-title":"Prod Plan Control"},{"key":"2789_CR13","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"2789_CR14","doi-asserted-by":"crossref","first-page":"868","DOI":"10.1016\/j.cor.2005.05.012","volume":"34","author":"A Gharbi","year":"2007","unstructured":"Gharbi A, Haouari M (2007) An approximate decomposition algorithm for scheduling on parallel machines with heads and tails. Comput Oper Res 34:868\u2013883","journal-title":"Comput Oper Res"},{"key":"2789_CR15","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham RL (1969) Bounds on multiprocessor timing anomalies. SIAM J Appl Math 17:416\u2013429","journal-title":"SIAM J Appl Math"},{"key":"2789_CR16","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1080\/09537280150203951","volume":"12","author":"JND Gupta","year":"2001","unstructured":"Gupta JND, Ruiz-Torres AJ (2001) A LISTFIT heuristic for minimizing makespan on identical parallel machines. Prod Plan Control 12:28\u201336","journal-title":"Prod Plan Control"},{"issue":"1","key":"2789_CR17","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s10479-012-1059-8","volume":"213","author":"N Hashemian","year":"2014","unstructured":"Hashemian N, Diallo C, Vizv\u00e1ri B (2014) Makespan minimization for parallel machines scheduling with multiple availability constraints. Ann Oper Res 213(1):173\u2013186","journal-title":"Ann Oper Res"},{"key":"2789_CR18","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.asoc.2013.12.005","volume":"16","author":"A Husseinzadeh Kashan","year":"2014","unstructured":"Husseinzadeh Kashan A (2014) League championship algorithm (LCA): a new algorithm for global optimization inspired by sport championships. Appl Soft Comput 16:171\u2013200","journal-title":"Appl Soft Comput"},{"key":"2789_CR19","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.cor.2014.10.011","volume":"55","author":"A Husseinzadeh Kashan","year":"2015","unstructured":"Husseinzadeh Kashan A (2015) A new metaheuristic for optimization: optics inspired optimization (OIO). Comput Oper Res 55:99\u2013125","journal-title":"Comput Oper Res"},{"key":"2789_CR20","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.cie.2008.05.007","volume":"56","author":"A Husseinzadeh Kashan","year":"2009","unstructured":"Husseinzadeh Kashan A, Karimi B (2009) A discrete particle swarm optimization algorithm for scheduling parallel machines. Comput Ind Eng 56:216\u2013223","journal-title":"Comput Ind Eng"},{"key":"2789_CR21","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1007\/s00170-008-1377-9","volume":"40","author":"A Husseinzadeh Kashan","year":"2009","unstructured":"Husseinzadeh Kashan A, Karimi B (2009) An improved mixed integer linear formulation and lower bounds for minimizing makespan on a flow shop with batch processing machines. Int J Adv Manuf Technol 40:582\u2013594","journal-title":"Int J Adv Manuf Technol"},{"key":"2789_CR22","doi-asserted-by":"crossref","unstructured":"Husseinzadeh Kashan A, Karimi B (2010) A new algorithm for constrained optimization inspired by the sport league championships. In: IEEE world congress on computational intelligence, WCCI 2010, pp 487\u2013494","DOI":"10.1109\/CEC.2010.5586364"},{"key":"2789_CR23","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1016\/j.cor.2006.07.005","volume":"35","author":"A Husseinzadeh Kashan","year":"2008","unstructured":"Husseinzadeh Kashan A, Karimi B, Jenabi M (2008) A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes. Comput Oper Res 35:1084\u20131098","journal-title":"Comput Oper Res"},{"key":"2789_CR24","doi-asserted-by":"crossref","unstructured":"Husseinzadeh Kashan A, Jenabi M, Husseinzadeh Kashan M (2009) A new solution approach for grouping problems based on evolution strategies. In: International conference of soft computing and pattern recognition","DOI":"10.1109\/SoCPaR.2009.29"},{"key":"2789_CR25","doi-asserted-by":"crossref","first-page":"1240","DOI":"10.1016\/j.patcog.2012.11.010","volume":"46","author":"A Husseinzadeh Kashan","year":"2013","unstructured":"Husseinzadeh Kashan A, Rezaee B, Karimiyan S (2013) An efficient approach for unsupervised fuzzy clustering based on grouping evolution strategy. Pattern Recogn 46:1240\u20131254","journal-title":"Pattern Recogn"},{"issue":"39","key":"2789_CR26","doi-asserted-by":"crossref","first-page":"2703","DOI":"10.1016\/j.apm.2014.11.001","volume":"2015","author":"A Husseinzadeh Kashan","year":"2015","unstructured":"Husseinzadeh Kashan A, Akbari AA, Ostadi B (2015) Grouping evolution strategies: an effective approach for grouping problems. Appl Math Model 2015(39):2703\u20132720","journal-title":"Appl Math Model"},{"key":"2789_CR27","unstructured":"Husseinzadeh Kashan A, Tavakkoli-Moghaddam R, Gen M (2016) A warfare inspired optimization algorithm: the find-fix-finish-exploit-analyze (F3EA) metaheuristic algorithm. In: Tenth international conference on management science and engineering management, ICMSEM 2016, pp 393\u2013408"},{"key":"2789_CR28","doi-asserted-by":"crossref","unstructured":"Iori M, Martello S (2008) Scatter search algorithms for identical parallel machine scheduling problems. In: Metaheuristics for scheduling in industrial and manufacturing applications. Springer, Berlin, pp 41\u201359","DOI":"10.1007\/978-3-540-78985-7_2"},{"key":"2789_CR29","unstructured":"Jing C, Guang-Liang L, Ran L (2011) Discrete harmony search algorithm for identical parallel machine scheduling problem. In: IEEE control conference (CCC), 2011 30th Chinese, pp 5457\u20135461"},{"key":"2789_CR30","unstructured":"Kedia SK (1971) A job scheduling problem with parallel processors. Technical Report. Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor"},{"key":"2789_CR31","unstructured":"Kowalczyk D, Leus R (2016) An exact algorithm for parallel machine scheduling with conflicts. J Sched 1\u201318"},{"issue":"1","key":"2789_CR32","doi-asserted-by":"crossref","first-page":"19","DOI":"10.4018\/ijoris.2015010102","volume":"6","author":"A Kuruvilla","year":"2015","unstructured":"Kuruvilla A, Paletta G (2015) Minimizing makespan on identical parallel machines. Int J Oper Res Inf Syst (IJORIS) 6(1):19\u201329","journal-title":"Int J Oper Res Inf Syst (IJORIS)"},{"key":"2789_CR33","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0166-218X(88)90079-0","volume":"20","author":"CY Lee","year":"1988","unstructured":"Lee CY, Massey JD (1988) Multiprocessor scheduling: combining LPT and MULTIFIT. Discrete Appl Math 20:233\u2013242","journal-title":"Discrete Appl Math"},{"key":"2789_CR34","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/s00170-005-0188-5","volume":"31","author":"WC Lee","year":"2006","unstructured":"Lee WC, Wu CC, Chen P (2006) A simulated annealing approach to makespan minimization on identical parallel machines. Int J Adv Manuf Technol 31:328\u2013334","journal-title":"Int J Adv Manuf Technol"},{"issue":"4","key":"2789_CR35","first-page":"286","volume":"33","author":"C Low","year":"2016","unstructured":"Low C, Wu GH (2016) Unrelated parallel-machine scheduling with controllable processing times and eligibility constraints to minimize the makespan. J Ind Prod Eng 33(4):286\u2013293","journal-title":"J Ind Prod Eng"},{"issue":"3","key":"2789_CR36","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.ejor.2008.03.043","volume":"197","author":"R Mellouli","year":"2009","unstructured":"Mellouli R, Sadfi C, Chu C, Kacem I (2009) Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times. Eur J Oper Res 197(3):1150\u20131165","journal-title":"Eur J Oper Res"},{"issue":"4","key":"2789_CR37","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/S0954-1810(99)00021-7","volume":"13","author":"L Min","year":"1999","unstructured":"Min L, Cheng W (1999) A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines. Artif Intell Eng 13(4):399\u2013403","journal-title":"Artif Intell Eng"},{"issue":"3","key":"2789_CR38","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1016\/S0377-2217(02)00726-9","volume":"152","author":"E Mokotoff","year":"2004","unstructured":"Mokotoff E (2004) An exact algorithm for the identical parallel machine scheduling problem. Eur J Oper Res 152(3):758\u2013769","journal-title":"Eur J Oper Res"},{"key":"2789_CR39","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.cie.2015.10.019","volume":"91","author":"SH Pakzad-Moghaddam","year":"2016","unstructured":"Pakzad-Moghaddam SH (2016) A L\u00e9vy flight embedded particle swarm optimization for multi-objective parallel-machine scheduling with learning and adapting considerations. Comput Ind Eng 91:109\u2013128","journal-title":"Comput Ind Eng"},{"key":"2789_CR40","unstructured":"Rechenberg I (1964) Cybernetic solution path of an experimental problem. Library Translation 1122, August 1965. Famborough Hants: royal aircraft establishment. English translation of lecture given at the Annual Conference of the WGLR, Berlin, 1964"},{"key":"2789_CR41","volume-title":"Evolutionsstrategie: optimierung technischer systeme nach den prinzipien der biologischen evolution","author":"I Rechenberg","year":"1973","unstructured":"Rechenberg I (1973) Evolutionsstrategie: optimierung technischer systeme nach den prinzipien der biologischen evolution. Frommann-Holzboog, Stuttgart"},{"key":"2789_CR42","unstructured":"Zarandi MF, Kayvanfar V (2014) A bi-objective identical parallel machine scheduling problem with controllable processing times: a just-in-time approach. Int J Adv Manuf Technol 1\u201319"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-016-2789-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2789-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-016-2789-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T20:14:37Z","timestamp":1568664877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-016-2789-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,27]]},"references-count":42,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["2789"],"URL":"https:\/\/doi.org\/10.1007\/s00521-016-2789-3","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,27]]}}}