{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T08:30:07Z","timestamp":1765269007198,"version":"3.30.2"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"21-22","license":[{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s00500-024-10311-2","type":"journal-article","created":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T08:41:27Z","timestamp":1732178487000},"page":"12603-12621","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Using parallel metaheuristics to solve a parallel U-shaped robotic mixed-model assembly line balancing and sequencing problem"],"prefix":"10.1007","volume":"28","author":[{"given":"Azadeh","family":"Farsi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahdi","family":"Mokhtarzadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masoud","family":"Rabbani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neda","family":"Manavizadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matin","family":"Ghasempour Anaraki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,21]]},"reference":[{"key":"10311_CR1","doi-asserted-by":"crossref","unstructured":"Abdel-Basset M, Luo Q, Miao F & Zhou Y (2017) Solving 0\u20131 knapsack problems by binary dragonfly algorithm. In: International Conference on Intelligent Computing (pp 491\u2013502). Springer, Cham","DOI":"10.1007\/978-3-319-63315-2_43"},{"key":"10311_CR2","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/j.cie.2015.10.012","volume":"90","author":"J Asl-Najafi","year":"2015","unstructured":"Asl-Najafi J, Zahiri B, Bozorgi-Amiri A, Taheri-Moghaddam A (2015) A dynamic closed-loop location-inventory problem under disruption risk. Comput Ind Eng 90:414\u2013428","journal-title":"Comput Ind Eng"},{"issue":"17","key":"10311_CR3","doi-asserted-by":"crossref","first-page":"8217","DOI":"10.1007\/s00500-018-3457-6","volume":"23","author":"H Babazadeh","year":"2019","unstructured":"Babazadeh H, Javadian N (2019) A novel meta-heuristic approach to solve fuzzy multi-objective straight and U-shaped assembly line balancing problems. Soft Comput 23(17):8217\u20138245","journal-title":"Soft Comput"},{"key":"10311_CR4","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2022.105112","volume":"114","author":"L Belkharroubi","year":"2022","unstructured":"Belkharroubi L, Yahyaoui K (2022) Solving the energy-efficient Robotic Mixed-Model Assembly Line balancing problem using a Memory-Based Cuckoo Search Algorithm. Eng Appl Artif Intell 114:105112","journal-title":"Eng Appl Artif Intell"},{"issue":"2\u20133","key":"10311_CR5","first-page":"97","volume":"37","author":"P Chutima","year":"2020","unstructured":"Chutima P, Jirachai P (2020) Parallel U-shaped assembly line balancing with adaptive MOEA\/D hybridized with BBO. J Ind Prod Eng 37(2\u20133):97\u2013119","journal-title":"J Ind Prod Eng"},{"key":"10311_CR6","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105775","volume":"143","author":"P Chutima","year":"2022","unstructured":"Chutima P, Khotsaenlee A (2022) Multi-objective parallel adjacent U-shaped assembly line balancing collaborated by robots and normal and disabled workers. Comput Oper Res 143:105775","journal-title":"Comput Oper Res"},{"key":"10311_CR7","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.asoc.2017.07.062","volume":"61","author":"ZA \u00c7il","year":"2017","unstructured":"\u00c7il ZA, Mete S, \u00d6zceylan E, A\u011fpak K (2017) A beam search approach for solving type II robotic parallel assembly line balancing problem. Appl Soft Comput 61:129\u2013138","journal-title":"Appl Soft Comput"},{"issue":"3","key":"10311_CR8","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1109\/TEVC.2004.826067","volume":"8","author":"CAC Coello","year":"2004","unstructured":"Coello CAC, Pulido GT, Lechuga MS (2004) Handling multiple objectives with particle swarm optimization. IEEE Trans Evol Comput 8(3):256\u2013279","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"10311_CR9","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan TAMT (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"10311_CR10","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/j.cie.2018.04.014","volume":"119","author":"FM Defersha","year":"2018","unstructured":"Defersha FM, Mohebalizadehgashti F (2018) Simultaneous balancing, sequencing, and station planning for a mixed model manual assembly line using hybrid genetic algorithm. Comput Ind Eng 119:370\u2013387","journal-title":"Comput Ind Eng"},{"issue":"3","key":"10311_CR11","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1080\/00207543.2015.1059965","volume":"54","author":"M Faccio","year":"2016","unstructured":"Faccio M, Gamberi M, Bortolini M (2016) Hierarchical approach for paced mixed-model assembly line balancing and sequencing with jolly operators. Int J Prod Res 54(3):761\u2013777","journal-title":"Int J Prod Res"},{"issue":"4","key":"10311_CR12","first-page":"292","volume":"18","author":"A Farsi","year":"2022","unstructured":"Farsi A, Torabi SA, Mokhtarzadeh M (2022) Integrated surgery scheduling by constraint programming and meta-heuristics. Int J Manage Sci Eng Manage 18(4):292\u2013304","journal-title":"Int J Manage Sci Eng Manage"},{"issue":"3","key":"10311_CR13","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1016\/j.cie.2008.09.027","volume":"56","author":"J Gao","year":"2009","unstructured":"Gao J, Sun L, Wang L, Gen M (2009) An efficient approach for type II robotic assembly line balancing problems. Comput Ind Eng 56(3):1065\u20131080","journal-title":"Comput Ind Eng"},{"issue":"2","key":"10311_CR14","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1016\/j.ijpe.2005.12.001","volume":"103","author":"H G\u00f6k\u00e7en","year":"2006","unstructured":"G\u00f6k\u00e7en H, A\u011fpak K, Benzer R (2006) Balancing of parallel assembly lines. Int J Prod Econ 103(2):600\u2013609","journal-title":"Int J Prod Econ"},{"issue":"2","key":"10311_CR15","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1504\/EJIE.2020.105698","volume":"14","author":"MN Janardhanan","year":"2020","unstructured":"Janardhanan MN, Nielsen P (2020) Optimisation of cost efficient robotic assembly line using metaheuristic algorithms. Eur J Ind Eng 14(2):247\u2013264","journal-title":"Eur J Ind Eng"},{"issue":"5","key":"10311_CR16","doi-asserted-by":"crossref","first-page":"2241","DOI":"10.1007\/s00500-021-06472-z","volume":"26","author":"M Khorram","year":"2022","unstructured":"Khorram M, Eghtesadifard M, Niroomand S (2022) Hybrid meta-heuristic algorithms for U-shaped assembly line balancing problem with equipment and worker allocations. Soft Comput 26(5):2241\u20132258","journal-title":"Soft Comput"},{"issue":"20","key":"10311_CR17","doi-asserted-by":"crossref","first-page":"5958","DOI":"10.1080\/00207543.2017.1312586","volume":"55","author":"I Kucukkoc","year":"2017","unstructured":"Kucukkoc I, Zhang DZ (2017) Balancing of mixed-model parallel U-shaped assembly lines considering model sequences. Int J Prod Res 55(20):5958\u20135975","journal-title":"Int J Prod Res"},{"issue":"3","key":"10311_CR18","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1016\/j.ejor.2004.07.030","volume":"168","author":"G Levitin","year":"2006","unstructured":"Levitin G, Rubinovitz J, Shnits B (2006) A genetic algorithm for robotic assembly line balancing. Eur J Oper Res 168(3):811\u2013825","journal-title":"Eur J Oper Res"},{"key":"10311_CR19","doi-asserted-by":"crossref","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"},{"issue":"5","key":"10311_CR20","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1080\/0305215X.2017.1351963","volume":"50","author":"Z Li","year":"2018","unstructured":"Li Z, Janardhanan MN, Tang Q, Nielsen P (2018) Mathematical model and metaheuristics for simultaneous balancing and sequencing of a robotic mixed-model assembly line. Eng Optim 50(5):877\u2013893","journal-title":"Eng Optim"},{"issue":"12","key":"10311_CR21","doi-asserted-by":"crossref","first-page":"9095","DOI":"10.1007\/s00521-018-3957-4","volume":"31","author":"Z Li","year":"2019","unstructured":"Li Z, Janardhanan MN, Ashour AS, Dey N (2019) Mathematical models and migrating birds optimization for robotic U-shaped assembly line balancing problem. Neural Comput Appl 31(12):9095\u20139111","journal-title":"Neural Comput Appl"},{"issue":"4","key":"10311_CR22","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1007\/s10845-020-01598-7","volume":"32","author":"Z Li","year":"2020","unstructured":"Li Z, Janardhanan MN, Ponnambalam S (2020) Cost-oriented robotic assembly line balancing problem with setup times: multi-objective algorithms. J Intell Manuf 32(4):989\u20131007","journal-title":"J Intell Manuf"},{"issue":"4","key":"10311_CR23","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1080\/0305215X.2020.1741569","volume":"53","author":"Z Li","year":"2021","unstructured":"Li Z, Janardhanan MN, Rahman HF (2021) Enhanced beam search heuristic for U-shaped assembly line balancing problems. Eng Optim 53(4):594\u2013608","journal-title":"Eng Optim"},{"issue":"4","key":"10311_CR24","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1007\/s00521-015-1920-1","volume":"27","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S (2016) Dragonfly algorithm: a new metaheuristic optimization technique for solving single-objective, discrete, and multi-objective problems. Neural Comput Appl 27(4):1053\u20131073","journal-title":"Neural Comput Appl"},{"issue":"5","key":"10311_CR25","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1080\/0951192X.2020.1736713","volume":"33","author":"M Mokhtarzadeh","year":"2020","unstructured":"Mokhtarzadeh M, Tavakkoli-Moghaddam R, Vahedi-Nouri B, Farsi A (2020) Scheduling of human-robot collaboration in assembly of printed circuit boards: a constraint programming approach. Int J Comput Integr Manuf 33(5):460\u2013473","journal-title":"Int J Comput Integr Manuf"},{"key":"10311_CR26","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/j.apm.2020.12.027","volume":"93","author":"M Mokhtarzadeh","year":"2021","unstructured":"Mokhtarzadeh M, Rabbani M, Manavizadeh N (2021) A novel two-stage framework for reducing ergonomic risks of a mixed-model parallel U-shaped assembly-line. Appl Math Model 93:597\u2013617","journal-title":"Appl Math Model"},{"issue":"4","key":"10311_CR27","doi-asserted-by":"crossref","first-page":"1359","DOI":"10.1016\/j.asoc.2011.11.027","volume":"12","author":"H Mosadegh","year":"2012","unstructured":"Mosadegh H, Zandieh M, Ghomi SF (2012) Simultaneous solving of balancing and sequencing problems with station-dependent assembly times for mixed-model assembly lines. Appl Soft Comput 12(4):1359\u20131370","journal-title":"Appl Soft Comput"},{"issue":"2","key":"10311_CR28","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1080\/0305215X.2014.998664","volume":"48","author":"J Mukund Nilakantan","year":"2016","unstructured":"Mukund Nilakantan J, Ponnambalam SG (2016) Robotic U-shaped assembly line balancing using particle swarm optimization. Eng Optim 48(2):231\u2013252","journal-title":"Eng Optim"},{"issue":"17","key":"10311_CR29","doi-asserted-by":"crossref","first-page":"5089","DOI":"10.1080\/00207540903055735","volume":"48","author":"U \u00d6zcan","year":"2010","unstructured":"\u00d6zcan U, \u00c7er\u00e7io\u011flu H, G\u00f6k\u00e7en H, Toklu B (2010) Balancing and sequencing of parallel mixed-model assembly lines. Int J Prod Res 48(17):5089\u20135113","journal-title":"Int J Prod Res"},{"issue":"14","key":"10311_CR30","doi-asserted-by":"crossref","first-page":"9559","DOI":"10.1007\/s00500-021-05921-z","volume":"25","author":"M P\u0131narba\u015f\u0131","year":"2021","unstructured":"P\u0131narba\u015f\u0131 M (2021) New chance-constrained models for U-type stochastic assembly line balancing problem. Soft Comput 25(14):9559\u20139573","journal-title":"Soft Comput"},{"issue":"7","key":"10311_CR31","first-page":"472","volume":"33","author":"M Rabbani","year":"2016","unstructured":"Rabbani M, Mousavi Z, Farrokhi-Asl H (2016) Multi-objective metaheuristics for solving a type II robotic mixed-model assembly line balancing problem. J Ind Prod Eng 33(7):472\u2013484","journal-title":"J Ind Prod Eng"},{"issue":"12","key":"10311_CR32","doi-asserted-by":"crossref","first-page":"2123","DOI":"10.1080\/0305215X.2018.1431234","volume":"50","author":"M Rabbani","year":"2018","unstructured":"Rabbani M, Heidari R, Farrokhi-Asl H (2018) A bi-objective mixed-model assembly line sequencing problem considering customer satisfaction and customer buying behaviour. Eng Optim 50(12):2123\u20132142","journal-title":"Eng Optim"},{"issue":"3","key":"10311_CR33","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/s12597-020-00489-y","volume":"58","author":"M Rabbani","year":"2021","unstructured":"Rabbani M, Mokhtarzadeh M, Manavizadeh N, Farsi A (2021) Solving a bi-objective mixed-model assembly-line sequencing using metaheuristic algorithms considering ergonomic factors, customer behavior, and periodic maintenance. Opsearch 58(3):513\u2013539","journal-title":"Opsearch"},{"issue":"1","key":"10311_CR34","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.aei.2006.09.007","volume":"21","author":"AR Rahimi-Vahed","year":"2007","unstructured":"Rahimi-Vahed AR, Rabbani M, Tavakkoli-Moghaddam R, Torabi SA, Jolai F (2007) A multi-objective scatter search for a mixed-model assembly line sequencing problem. Adv Eng Inform 21(1):85\u201399","journal-title":"Adv Eng Inform"},{"issue":"1","key":"10311_CR35","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1016\/S0007-8506(07)62494-9","volume":"42","author":"J Rubinovitz","year":"1993","unstructured":"Rubinovitz J, Bukchin J, Lenz E (1993) Robotic assembly line balancing\u2014a heuristic algorithm for design and balancing of robotic assembly lines. CIRP Ann Manuf Technol 42(1):497\u2013500","journal-title":"CIRP Ann Manuf Technol"},{"issue":"3","key":"10311_CR36","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1007\/s10845-017-1316-4","volume":"30","author":"U Saif","year":"2019","unstructured":"Saif U, Guan Z, Zhang L, Zhang F, Wang B, Mirza J (2019) Multi-objective artificial bee colony algorithm for order oriented simultaneous sequencing and balancing of multi-mixed model assembly line. J Intell Manuf 30(3):1195\u20131220","journal-title":"J Intell Manuf"},{"issue":"6","key":"10311_CR37","doi-asserted-by":"crossref","first-page":"2424","DOI":"10.1108\/EC-12-2020-0747","volume":"39","author":"H Soysal-Kurt","year":"2022","unstructured":"Soysal-Kurt H, \u0130\u015fleyen SK (2022) Multi-objective optimization of cycle time and energy consumption in parallel robotic assembly lines using a discrete firefly algorithm. Eng Comput 39(6):2424\u20132448","journal-title":"Eng Comput"},{"issue":"1","key":"10311_CR38","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/00207543.2021.1989077","volume":"60","author":"KE Stecke","year":"2022","unstructured":"Stecke KE, Mokhtarzadeh M (2022) Balancing collaborative human\u2013robot assembly lines to optimise cycle time and ergonomic risk. Int J Prod Res 60(1):25\u201347","journal-title":"Int J Prod Res"},{"key":"10311_CR39","volume":"146","author":"B-Q Sun","year":"2020","unstructured":"Sun B-Q, Wang L, Peng Z-P (2020) Bound-guided hybrid estimation of distribution algorithm for energy-efficient robotic assembly lie balancing. Comput Ind Eng 146:106604","journal-title":"Comput Ind Eng"},{"key":"10311_CR40","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/j.apm.2017.02.005","volume":"44","author":"XS Suo","year":"2017","unstructured":"Suo XS, Yu XQ, Li HS (2017) Subset simulation for multi-objective optimization. Appl Math Model 44:425\u2013445","journal-title":"Appl Math Model"},{"issue":"17","key":"10311_CR41","doi-asserted-by":"crossref","first-page":"5520","DOI":"10.1080\/00207543.2018.1530479","volume":"57","author":"Z Zhang","year":"2019","unstructured":"Zhang Z, Tang Q, Li Z, Zhang L (2019) Modelling and optimisation of energy-efficient U-shaped robotic assembly line balancing problems. Int J Prod Res 57(17):5520\u20135537","journal-title":"Int J Prod Res"},{"key":"10311_CR42","volume":"244","author":"B Zhang","year":"2020","unstructured":"Zhang B, Xu L, Zhang J (2020) A multi-objective cellular genetic algorithm for energy-oriented balancing and sequencing problem of mixed-model assembly line. J Clean Prod 244:118845","journal-title":"J Clean Prod"},{"key":"10311_CR43","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2020.106739","volume":"98","author":"B Zhang","year":"2021","unstructured":"Zhang B, Xu L, Zhang J (2021) Balancing and sequencing problem of mixed-model U-shaped robotic assembly line: mathematical model and dragonfly algorithm based approach. Appl Soft Comput 98:106739","journal-title":"Appl Soft Comput"},{"issue":"2","key":"10311_CR44","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/j.ejor.2017.06.056","volume":"264","author":"I \u017dulj","year":"2018","unstructured":"\u017dulj I, Kramer S, Schneider M (2018) A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem. Eur J Oper Res 264(2):653\u2013664","journal-title":"Eur J Oper Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-10311-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-024-10311-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-10311-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T07:32:54Z","timestamp":1733902374000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-024-10311-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":44,"journal-issue":{"issue":"21-22","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["10311"],"URL":"https:\/\/doi.org\/10.1007\/s00500-024-10311-2","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2024,11]]},"assertion":[{"value":"26 June 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This study does not contain any studies with human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}