{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T00:43:13Z","timestamp":1772844193068,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,7,17]],"date-time":"2017-07-17T00:00:00Z","timestamp":1500249600000},"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":["Memetic Comp."],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s12293-017-0239-0","type":"journal-article","created":{"date-parts":[[2017,7,17]],"date-time":"2017-07-17T16:52:50Z","timestamp":1500310370000},"page":"213-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["An efficient grouping genetic algorithm for U-shaped assembly line balancing problems with maximizing production rate"],"prefix":"10.1007","volume":"9","author":[{"given":"Murat","family":"\u015eahin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Talip","family":"Kelleg\u00f6z","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,17]]},"reference":[{"issue":"2","key":"239_CR1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s12293-015-0177-7","volume":"8","author":"LT Bui","year":"2016","unstructured":"Bui LT, Binh HTT (2016) A survivable design of last mile communication networks using multi-objective genetic algorithms. Memet Comput 8(2):97\u2013108","journal-title":"Memet Comput"},{"issue":"3","key":"239_CR2","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0378-4754(99)00122-6","volume":"51","author":"P Lit De","year":"2000","unstructured":"De Lit P, Falkenauer E, Delchambre A (2000) Grouping genetic algorithms: an efficient method to solve the cell formation problem. Math Comput Simul 51(3):257\u2013271","journal-title":"Math Comput Simul"},{"issue":"1","key":"239_CR3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269\u2013271","journal-title":"Numer Math"},{"issue":"24","key":"239_CR4","doi-asserted-by":"crossref","first-page":"7529","DOI":"10.1080\/00207543.2014.944280","volume":"52","author":"J Dong","year":"2014","unstructured":"Dong J, Zhang L, Xiao T, Mao H (2014) Balancing and sequencing of stochastic mixed-model assembly U-lines to minimise the expectation of work overload time. Int J Prod Res 52(24):7529\u20137548","journal-title":"Int J Prod Res"},{"key":"239_CR5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/MHS.1995.494215","volume":"1","author":"RC Eberhart","year":"1995","unstructured":"Eberhart RC, Kennedy J (1995) A new optimizer using particle swarm theory. Proc Sixth Int Symp Micro Mach Hum Sci 1:39\u201343","journal-title":"Proc Sixth Int Symp Micro Mach Hum Sci"},{"issue":"5","key":"239_CR6","doi-asserted-by":"crossref","first-page":"1318","DOI":"10.1080\/00207543.2013.832489","volume":"52","author":"A Fattahi","year":"2014","unstructured":"Fattahi A, Elaoud S, Sadeqi Azer E, Turkay M (2014) A novel integer programming formulation with logic cuts for the U-shaped assembly line balancing problem. Int J Prod Res 52(5):1318\u20131333","journal-title":"Int J Prod Res"},{"issue":"1","key":"239_CR7","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E Falkenauer","year":"1996","unstructured":"Falkenauer E (1996) A hybrid grouping genetic algorithm for bin packing. J Heuristics 2(1):5\u201330","journal-title":"J Heuristics"},{"issue":"4","key":"239_CR8","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.apm.2004.10.003","volume":"29","author":"H G\u00f6k\u00e7en","year":"2005","unstructured":"G\u00f6k\u00e7en H, A\u011fpak K, Gencer C, Kizilkaya E (2005) A shortest route formulation of simple U-type assembly line balancing problem. Appl Math Model 29(4):373\u2013380","journal-title":"Appl Math Model"},{"issue":"2","key":"239_CR9","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1287\/mnsc.11.2.308","volume":"11","author":"AL Gutjahr","year":"1964","unstructured":"Gutjahr AL, Nemhauser GL (1964) An algorithm for the line balancing problem. Manag Sci 11(2):308\u2013315","journal-title":"Manag Sci"},{"key":"239_CR10","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor"},{"issue":"4","key":"239_CR11","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1016\/j.jmsy.2014.05.002","volume":"33","author":"S Jayaswal","year":"2014","unstructured":"Jayaswal S, Agarwal P (2014) Balancing U-shaped assembly lines with resource dependent task times: a simulated annealing approach. J Manuf Syst 33(4):522\u2013534","journal-title":"J Manuf Syst"},{"issue":"1","key":"239_CR12","first-page":"6168","volume":"19","author":"V Jonnalagedda","year":"2014","unstructured":"Jonnalagedda V, Dabade B (2014) Application of simple genetic algorithm to U-shaped assembly line balancing problem of type II. IFAC World Congr 19(1):6168\u20136173","journal-title":"IFAC World Congr"},{"issue":"15","key":"239_CR13","doi-asserted-by":"crossref","first-page":"4201","DOI":"10.1080\/00207540801905486","volume":"47","author":"Y Kara","year":"2009","unstructured":"Kara Y, Tekin M (2009) A mixed integer linear programming formulation for optimal balancing of mixed-model U-lines. Int J Prod Res 47(15):4201\u20134233","journal-title":"Int J Prod Res"},{"issue":"3","key":"239_CR14","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1016\/j.cor.2007.11.003","volume":"36","author":"YK Kim","year":"2009","unstructured":"Kim YK, Song WS, Kim JH (2009) A mathematical model and a genetic algorithm for two-sided assembly line balancing. Comput Oper Res 36(3):853\u2013865","journal-title":"Comput Oper Res"},{"issue":"3","key":"239_CR15","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/0360-8352(96)00009-5","volume":"30","author":"YK Kim","year":"1996","unstructured":"Kim YK, Kim YJ, Kim Y (1996) Genetic algorithms for assembly line balancing with various objectives. Comput Ind Eng 30(3):397\u2013409","journal-title":"Comput Ind Eng"},{"issue":"2","key":"239_CR16","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0377-2217(95)00047-X","volume":"91","author":"R Klein","year":"1996","unstructured":"Klein R, Scholl A (1996) Maximizing the production rate in simple assembly line balancing\u2014a branch and bound procedure. Eur J Oper Res 91(2):367\u2013385","journal-title":"Eur J Oper Res"},{"key":"239_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Simulated annealing","author":"VPJ Laarhoven","year":"1987","unstructured":"Laarhoven VPJ, Aarts EH (1987) Simulated annealing. Springer, Dordrecht"},{"issue":"10","key":"239_CR18","doi-asserted-by":"crossref","first-page":"1378","DOI":"10.1287\/mnsc.40.10.1378","volume":"40","author":"GJ Miltenburg","year":"1994","unstructured":"Miltenburg GJ, Wijngaard J (1994) The U-line line balancing problem. Manag Sci 40(10):1378\u20131388","journal-title":"Manag Sci"},{"issue":"9\u201310","key":"239_CR19","doi-asserted-by":"crossref","first-page":"1016","DOI":"10.1007\/s00170-006-0655-7","volume":"34","author":"AC Nearchou","year":"2007","unstructured":"Nearchou AC (2007) Balancing large assembly lines by a new heuristic based on differential evolution method. Int J Adv Manuf Technol 34(9\u201310):1016\u20131029","journal-title":"Int J Adv Manuf Technol"},{"issue":"6","key":"239_CR20","doi-asserted-by":"crossref","first-page":"1605","DOI":"10.1080\/00207541003690090","volume":"49","author":"U \u00d6zcan","year":"2011","unstructured":"\u00d6zcan U, Kelleg\u00f6z T, Toklu B (2011) A genetic algorithm for the stochastic mixed-model U-line balancing and sequencing problem. Int J Prod Res 49(6):1605\u20131626","journal-title":"Int J Prod Res"},{"issue":"2","key":"239_CR21","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1108\/01445151111117700","volume":"31","author":"DI Petropoulos","year":"2011","unstructured":"Petropoulos DI, Nearchou AC (2011) A particle swarm optimization algorithm for balancing assembly lines. Assem Autom 31(2):118\u2013129","journal-title":"Assem Autom"},{"key":"239_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-017-0232-7","author":"A Rezoug","year":"2017","unstructured":"Rezoug A, Bader-El-Den M, Boughaci D (2017) Guided genetic algorithm for the multidimensional knapsack problem. Memet Comput (in press). doi:\n                        10.1007\/s12293-017-0232-7","journal-title":"Memet Comput (in press)"},{"issue":"4","key":"239_CR23","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1080\/002075499191481","volume":"37","author":"A Scholl","year":"1999","unstructured":"Scholl A, Klein R (1999) ULINO: optimally balancing U-shaped JIT assembly lines. Int J Prod Res 37(4):721\u2013736","journal-title":"Int J Prod Res"},{"key":"239_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-11223-6","volume-title":"Balancing and sequencing of assembly lines","author":"A Scholl","year":"1999","unstructured":"Scholl A (1999) Balancing and sequencing of assembly lines. Physica, Heidelberg"},{"issue":"1","key":"239_CR25","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/TPWRS.2005.860922","volume":"21","author":"DN Simopoulos","year":"2006","unstructured":"Simopoulos DN, Kavatza SD, Vournas CD (2006) Unit commitment by an enhanced simulated annealing algorithm. IEEE Trans Power Syst 21(1):68\u201376","journal-title":"IEEE Trans Power Syst"},{"key":"239_CR26","volume-title":"Schedule optimization using genetic algorithms","author":"G Syswerda","year":"1991","unstructured":"Syswerda G (1991) Schedule optimization using genetic algorithms. Van Nostrand Reinhold, New York"},{"issue":"8","key":"239_CR27","doi-asserted-by":"crossref","first-page":"1401","DOI":"10.1080\/0305215X.2016.1256394","volume":"49","author":"M \u015eahin","year":"2017","unstructured":"\u015eahin M, Kelleg\u00f6z T (2017) Increasing production rate in U-type assembly lines with sequence-dependent set-up times. Eng Optim 49(8):1401\u20131419","journal-title":"Eng Optim"},{"key":"239_CR28","doi-asserted-by":"crossref","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: from design to implementation","author":"EG Talbi","year":"2009","unstructured":"Talbi EG (2009) Metaheuristics: from design to implementation. Wiley, New York"},{"key":"239_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-017-0234-5","author":"MA Tawhid","year":"2017","unstructured":"Tawhid MA, Ali AF (2017) A Hybrid grey wolf optimizer and genetic algorithm for minimizing potential energy function. Memet Comput (in press). doi:\n                        10.1007\/s12293-017-0234-5","journal-title":"Memet Comput (in press)"},{"issue":"1","key":"239_CR30","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s12293-015-0173-y","volume":"8","author":"B Tran","year":"2016","unstructured":"Tran B, Xue B, Zhang M (2016) Genetic programming for feature construction and selection in classification on high-dimensional data. Memet Comput 8(1):3\u201315","journal-title":"Memet Comput"},{"issue":"5","key":"239_CR31","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1287\/mnsc.44.5.738","volume":"44","author":"TL Urban","year":"1998","unstructured":"Urban TL (1998) Note: optimal balancing of U-shaped assembly lines. Manag Sci 44(5):738\u2013741","journal-title":"Manag Sci"},{"issue":"2","key":"239_CR32","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.jmsy.2011.10.002","volume":"31","author":"A Yoosefelahi","year":"2012","unstructured":"Yoosefelahi A, Aminnayeri M, Mosadegh H, Ardakani HD (2012) Type II robotic assembly line balancing problem: an evolution strategies algorithm for a multi-objective model. J Manuf Syst 31(2):139\u2013151","journal-title":"J Manuf Syst"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-017-0239-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-017-0239-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-017-0239-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,19]],"date-time":"2017-08-19T02:12:22Z","timestamp":1503108742000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-017-0239-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,17]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["239"],"URL":"https:\/\/doi.org\/10.1007\/s12293-017-0239-0","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,17]]}}}