{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T22:23:17Z","timestamp":1778538197151,"version":"3.51.4"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T00:00:00Z","timestamp":1530144000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["51275366"],"award-info":[{"award-number":["51275366"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s00521-018-3596-9","type":"journal-article","created":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T12:10:45Z","timestamp":1530187845000},"page":"7501-7515","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":40,"title":["Enhanced migrating birds optimization algorithm for U-shaped assembly line balancing problems with workers assignment"],"prefix":"10.1007","volume":"31","author":[{"given":"Zikai","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiuhua","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dayong","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zixiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,28]]},"reference":[{"key":"3596_CR1","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1016\/j.cie.2013.01.001","volume":"64","author":"S Avikal","year":"2013","unstructured":"Avikal S, Jain R, Mishra PK et al (2013) A heuristic approach for U-shaped assembly line balancing to improve labor productivity. Comput Ind Eng 64:895\u2013901","journal-title":"Comput Ind Eng"},{"key":"3596_CR2","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00170-005-0322-4","volume":"32","author":"A Baykaso\u011flu","year":"2006","unstructured":"Baykaso\u011flu A, \u00d6zbak\u0131r L (2006) Stochastic U-line balancing using genetic algorithms. Int J Adv Manuf Technol 32:139\u2013147","journal-title":"Int J Adv Manuf Technol"},{"key":"3596_CR3","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/j.cor.2010.05.008","volume":"38","author":"C Blum","year":"2011","unstructured":"Blum C, Miralles C (2011) On solving the assembly line worker assignment and balancing problem via beam search. Comput Oper Res 38:328\u2013339","journal-title":"Comput Oper Res"},{"key":"3596_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.cor.2013.12.002","volume":"45","author":"L Borba","year":"2014","unstructured":"Borba L, Ritt M (2014) A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem. Comput Oper Res 45:87\u201396","journal-title":"Comput Oper Res"},{"key":"3596_CR5","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.eswa.2015.12.018","volume":"50","author":"K Buyukozkan","year":"2016","unstructured":"Buyukozkan K, Kucukkoc I, Satoglu SI et al (2016) Lexicographic bottleneck mixed-model assembly line balancing problem: artificial bee colony and tabu search approaches with optimised parameters. Expert Syst Appl 50:151\u2013166","journal-title":"Expert Syst Appl"},{"key":"3596_CR6","doi-asserted-by":"crossref","unstructured":"Chaves AA, Lorena LA, Miralles C (2009) Hybrid metaheuristic for the assembly line worker assignment and balancing problem. In: Hybrid metaheuristics, international workshop, Hm 2009, Udine, Italy, 16\u201317 October 2009. Proceedings. pp 1\u201314","DOI":"10.1007\/978-3-642-04918-7_1"},{"key":"3596_CR7","unstructured":"Chaves AA, Miralles C, Lorena LaN (2007) Clustering search approach for the assembly line worker assignment and balancing problem. In: Proceedings of the 37th international conference on computers and industrial engineering, Alexandria, Egypt, pp 1469\u20131478"},{"key":"3596_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10288-016-0320-4","volume":"15","author":"Y Delice","year":"2016","unstructured":"Delice Y, Aydo\u011fan EK, \u00d6zcan U et al (2016) Balancing two-sided U-type assembly lines using modified particle swarm optimization algorithm. 4OR 15:37\u201366","journal-title":"4OR"},{"key":"3596_CR9","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1108\/AA-08-2016-104","volume":"37","author":"J Dou","year":"2017","unstructured":"Dou J, Li J, Zhao X (2017) A novel discrete particle swarm algorithm for assembly line balancing problems. Assem Autom 37:452\u2013463","journal-title":"Assem Autom"},{"key":"3596_CR10","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.ins.2012.06.032","volume":"217","author":"E Duman","year":"2012","unstructured":"Duman E, Uysal M, Alkaya AF (2012) Migrating birds optimization: a new metaheuristic approach and its performance on quadratic assignment problem. Inf Sci 217:65\u201377","journal-title":"Inf Sci"},{"key":"3596_CR11","doi-asserted-by":"publisher","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 et al (2005) A shortest route formulation of simple U-type assembly line balancing problem. Appl Math Model 29:373\u2013380","journal-title":"Appl Math Model"},{"key":"3596_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2015.04.001","volume":"62","author":"A Garc\u00eda-Villoria","year":"2015","unstructured":"Garc\u00eda-Villoria A, Corominas A, Pastor R (2015) Heuristics and simulated annealing procedures for the accessibility windows assembly line problem level 1 (AWALBP-L1). Comput Oper Res 62:1\u201311","journal-title":"Comput Oper Res"},{"key":"3596_CR13","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ijpe.2012.03.013","volume":"141","author":"N Hamta","year":"2013","unstructured":"Hamta N, Fatemi Ghomi SMT, Jolai F et al (2013) A hybrid PSO algorithm for a multi-objective assembly line balancing problem with flexible operation times, sequence-dependent setup times and learning effect. Int J Prod Econ 141:99\u2013111","journal-title":"Int J Prod Econ"},{"key":"3596_CR14","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.cor.2015.01.010","volume":"59","author":"DA Haz\u0131r","year":"2015","unstructured":"Haz\u0131r DA (2015) A decomposition based solution algorithm for U-type assembly line balancing with interval data. Comput Oper Res 59:126\u2013131","journal-title":"Comput Oper Res"},{"key":"3596_CR15","doi-asserted-by":"publisher","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:522\u2013534","journal-title":"J Manuf Syst"},{"key":"3596_CR16","doi-asserted-by":"publisher","first-page":"3344","DOI":"10.1016\/j.cor.2012.04.019","volume":"39","author":"T Kelleg\u00f6z","year":"2012","unstructured":"Kelleg\u00f6z T, Toklu B (2012) An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations. Comput Oper Res 39:3344\u20133360","journal-title":"Comput Oper Res"},{"key":"3596_CR17","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.apm.2016.12.031","volume":"48","author":"M Li","year":"2017","unstructured":"Li M, Tang Q, Zheng Q et al (2017) A rules\u2013based heuristic approach for the U-shaped assembly line balancing problem. Appl Math Model 48:423\u2013439","journal-title":"Appl Math Model"},{"key":"3596_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-017-2855-5","author":"Z Li","year":"2017","unstructured":"Li Z, Dey N, Ashour AS et al (2017) Discrete cuckoo search algorithms for two-sided robotic assembly line balancing problem. Neural Comput Appl. \n                    https:\/\/doi.org\/10.1007\/s00521-017-2855-5","journal-title":"Neural Comput Appl"},{"key":"3596_CR19","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1016\/j.jclepro.2016.06.131","volume":"135","author":"Z Li","year":"2016","unstructured":"Li Z, Tang Q, Zhang L (2016) Minimizing energy consumption and cycle time in two-sided robotic assembly line systems using restarted simulated annealing algorithm. J Clean Prod 135:508\u2013522","journal-title":"J Clean Prod"},{"key":"3596_CR20","doi-asserted-by":"publisher","first-page":"4493","DOI":"10.1016\/j.apm.2014.02.029","volume":"38","author":"D-Y Lin","year":"2014","unstructured":"Lin D-Y, Chu Y-M (2014) A Lagrangian relaxation approach to the mixed-product assembly line sequencing problem: a case study of a door-lock company in Taiwan. Appl Math Model 38:4493\u20134511","journal-title":"Appl Math Model"},{"key":"3596_CR21","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s00170-006-0821-y","volume":"36","author":"SB Liu","year":"2006","unstructured":"Liu SB, Ng KM, Ong HL (2006) Branch-and-bound algorithms for simple assembly line balancing problem. Int J Adv Manuf Technol 36:169\u2013177","journal-title":"Int J Adv Manuf Technol"},{"key":"3596_CR22","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.swevo.2017.06.003","volume":"38","author":"T Meng","year":"2017","unstructured":"Meng T, Pan Q-K, Li J-Q et al (2017) An improved migrating birds optimization for an integrated lot-streaming flow shop scheduling problem. Swarm Evol Comput 38:64\u201378","journal-title":"Swarm Evol Comput"},{"key":"3596_CR23","doi-asserted-by":"publisher","first-page":"1378","DOI":"10.1287\/mnsc.40.10.1378","volume":"40","author":"GJ Miltenburg","year":"1994","unstructured":"Miltenburg GJ, Wijingaard J (1994) The U-line line balancing problem. Manag Sci 40:1378\u20131388","journal-title":"Manag Sci"},{"key":"3596_CR24","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/j.dam.2005.12.012","volume":"156","author":"C Miralles","year":"2008","unstructured":"Miralles C, Garc\u00eda-Sabater JP, Andr\u00e9s C et al (2008) Branch and bound procedures for solving the assembly line worker assignment and balancing problem: application to sheltered work centres for disabled. Discrete Appl Math 156:352\u2013367","journal-title":"Discrete Appl Math"},{"key":"3596_CR25","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s10732-012-9195-5","volume":"18","author":"MCO Moreira","year":"2012","unstructured":"Moreira MCO, Ritt M, Costa AM et al (2012) Simple heuristics for the assembly line worker assignment and balancing problem. J Heuristics 18:505\u2013524","journal-title":"J Heuristics"},{"key":"3596_CR26","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.cor.2012.07.010","volume":"40","author":"PO Mutlu","year":"2013","unstructured":"Mutlu PO, Supciller AA (2013) An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II. Comput Oper Res 40:418\u2013426","journal-title":"Comput Oper Res"},{"key":"3596_CR27","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.jocs.2012.09.001","volume":"4","author":"A Nourmohammadi","year":"2013","unstructured":"Nourmohammadi A, Zandieh M, Tavakkoli-Moghaddam R (2013) An imperialist competitive algorithm for multi-objective U-type assembly line design. J Comput Sci 4:393\u2013400","journal-title":"J Comput Sci"},{"key":"3596_CR28","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.jmsy.2015.02.007","volume":"36","author":"D Ogan","year":"2015","unstructured":"Ogan D, Azizoglu M (2015) A branch and bound method for the line balancing problem in U-shaped assembly lines with equipment requirements. J Manuf Syst 36:46\u201354","journal-title":"J Manuf Syst"},{"key":"3596_CR29","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.cie.2017.08.030","volume":"112","author":"MK Oksuz","year":"2017","unstructured":"Oksuz MK, Buyukozkan K, Satoglu SI (2017) U-shaped assembly line worker assignment and balancing problem: a mathematical model and two meta-heuristics. Comput Ind Eng 112:246\u2013263","journal-title":"Comput Ind Eng"},{"key":"3596_CR30","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.jmsy.2012.02.002","volume":"31","author":"M Rabbani","year":"2012","unstructured":"Rabbani M, Kazemi SM, Manavizadeh N (2012) Mixed model U-line balancing type-1 problem: a new approach. J Manuf Syst 31:131\u2013138","journal-title":"J Manuf Syst"},{"key":"3596_CR31","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s40092-016-0158-6","volume":"12","author":"M Rabbani","year":"2016","unstructured":"Rabbani M, Montazeri M, Farrokhi-Asl H et al (2016) A multi-objective genetic algorithm for a mixed-model assembly U-line balancing type-I problem considering human-related issues, training, and learning. J Ind Eng Int 12:485\u2013497","journal-title":"J Ind Eng Int"},{"key":"3596_CR32","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.cie.2015.04.017","volume":"87","author":"R Ramezanian","year":"2015","unstructured":"Ramezanian R, Ezzatpanah A (2015) Modeling and solving multi-objective mixed-model assembly line balancing and worker assignment problem. Comput Ind Eng 87:74\u201380","journal-title":"Comput Ind Eng"},{"key":"3596_CR33","doi-asserted-by":"publisher","first-page":"2731","DOI":"10.1080\/00207543.2016.1181286","volume":"55","author":"A Roshani","year":"2016","unstructured":"Roshani A, Giglio D (2016) Simulated annealing algorithms for the multi-manned assembly line balancing problem: minimising cycle time. Int J Prod Res 55:2731\u20132751","journal-title":"Int J Prod Res"},{"key":"3596_CR34","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.jmsy.2012.11.003","volume":"32","author":"A Roshani","year":"2013","unstructured":"Roshani A, Roshani A, Roshani A et al (2013) A simulated annealing algorithm for multi-manned assembly line balancing problem. J Manuf Syst 32:238\u2013247","journal-title":"J Manuf Syst"},{"key":"3596_CR35","doi-asserted-by":"publisher","DOI":"10.1080\/19386362.2017.1305652","author":"S Rukhaiyar","year":"2017","unstructured":"Rukhaiyar S, Alam MN, Samadhiya NK (2017) A PSO-ANN hybrid model for predicting factor of safety of slope. Int J Geotech Eng. \n                    https:\/\/doi.org\/10.1080\/19386362.2017.1305652","journal-title":"Int J Geotech Eng"},{"key":"3596_CR36","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s12293-017-0239-0","volume":"9","author":"M \u015eahin","year":"2017","unstructured":"\u015eahin M, Kelleg\u00f6z T (2017) An efficient grouping genetic algorithm for U-shaped assembly line balancing problems with maximizing production rate. Memet Comput 9:213\u2013229","journal-title":"Memet Comput"},{"key":"3596_CR37","doi-asserted-by":"publisher","first-page":"1809","DOI":"10.1007\/s00170-014-6153-4","volume":"75","author":"U Saif","year":"2014","unstructured":"Saif U, Guan Z, Liu W et al (2014) Multi-objective artificial bee colony algorithm for simultaneous sequencing and balancing of mixed model assembly line. Int J Adv Manuf Technol 75:1809\u20131827","journal-title":"Int J Adv Manuf Technol"},{"key":"3596_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2014.07.009","volume":"76","author":"U Saif","year":"2014","unstructured":"Saif U, Guan Z, Liu W et al (2014) Pareto based artificial bee colony algorithm for multi objective single model assembly line balancing with uncertain task times. Comput Ind Eng 76:1\u201315","journal-title":"Comput Ind Eng"},{"key":"3596_CR39","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.ejor.2017.06.027","volume":"264","author":"A Sioud","year":"2017","unstructured":"Sioud A, Gagn\u00e9 C (2017) Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times. Eur J Oper Res 264:66\u201373","journal-title":"Eur J Oper Res"},{"key":"3596_CR40","doi-asserted-by":"publisher","first-page":"2954","DOI":"10.1016\/j.apm.2007.10.007","volume":"32","author":"MD Toksar\u0131","year":"2008","unstructured":"Toksar\u0131 MD, \u0130\u015fleyen SK, G\u00fcner E et al (2008) Simple and U-type assembly line balancing problems with a learning effect. Appl Math Model 32:2954\u20132961","journal-title":"Appl Math Model"},{"key":"3596_CR41","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.cor.2013.10.016","volume":"44","author":"M Vil\u00e0","year":"2014","unstructured":"Vil\u00e0 M, Pereira J (2014) A branch-and-bound algorithm for assembly line worker assignment and balancing problems. Comput Oper Res 44:105\u2013114","journal-title":"Comput Oper Res"},{"key":"3596_CR42","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.cie.2011.11.033","volume":"65","author":"C Yang","year":"2013","unstructured":"Yang C, Gao J, Sun L (2013) A multi-objective genetic algorithm for mixed-model assembly line rebalancing. Comput Ind Eng 65:109\u2013116","journal-title":"Comput Ind Eng"},{"key":"3596_CR43","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.cie.2016.05.026","volume":"98","author":"Z Yuguang","year":"2016","unstructured":"Yuguang Z, Bo A, Yong Z (2016) A PSO algorithm for multi-objective hull assembly line balancing using the stratified optimization strategy. Comput Ind Eng 98:53\u201362","journal-title":"Comput Ind Eng"},{"key":"3596_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.engappai.2015.11.007","volume":"49","author":"PT Zacharia","year":"2016","unstructured":"Zacharia PT, Nearchou AC (2016) A population-based algorithm for the bi-objective assembly line worker assignment and balancing problem. Eng Appl Artif Intell 49:1\u20139","journal-title":"Eng Appl Artif Intell"},{"key":"3596_CR45","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.jmsy.2013.08.002","volume":"33","author":"J Zha","year":"2014","unstructured":"Zha J, Yu J-J (2014) A hybrid ant colony algorithm for U-line balancing and rebalancing in just-in-time production environment. J Manuf Syst 33:93\u2013102","journal-title":"J Manuf Syst"},{"key":"3596_CR46","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.asoc.2016.12.021","volume":"52","author":"B Zhang","year":"2017","unstructured":"Zhang B, Pan Q-K, Gao L et al (2017) An effective modified migrating birds optimization for hybrid flowshop scheduling problem with lot streaming. Appl Soft Comput 52:14\u201327","journal-title":"Appl Soft Comput"},{"key":"3596_CR47","doi-asserted-by":"publisher","DOI":"10.1177\/1748301817710924","author":"H-Y Zhang","year":"2017","unstructured":"Zhang H-Y (2017) An improved immune algorithm for simple assembly line balancing problem of type 1. J. Algorithms Comput Technol. \n                    https:\/\/doi.org\/10.1177\/1748301817710924","journal-title":"J. Algorithms Comput Technol."},{"key":"3596_CR48","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.engappai.2015.03.005","volume":"47","author":"X Zhao","year":"2016","unstructured":"Zhao X, Hsu C-Y, Chang P-C et al (2016) A genetic algorithm for the multi-objective optimization of mixed-model assembly line based on the mental workload. Eng Appl Artif Intell 47:140\u2013146","journal-title":"Eng Appl Artif Intell"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-018-3596-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-018-3596-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-018-3596-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,24]],"date-time":"2019-10-24T16:31:58Z","timestamp":1571934718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-018-3596-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,28]]},"references-count":48,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["3596"],"URL":"https:\/\/doi.org\/10.1007\/s00521-018-3596-9","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,28]]},"assertion":[{"value":"21 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2018","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":"We are the authors ensuring that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}