{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T04:58:38Z","timestamp":1779339518708,"version":"3.51.4"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T00:00:00Z","timestamp":1585612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T00:00:00Z","timestamp":1585612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s12351-020-00561-x","type":"journal-article","created":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T16:03:47Z","timestamp":1585670627000},"page":"577-614","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A hyper-heuristic approach for stochastic parallel assembly line balancing problems with equipment costs"],"prefix":"10.1007","volume":"22","author":[{"given":"Lale","family":"\u00d6zbak\u0131r","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00f6khan","family":"Se\u00e7me","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,31]]},"reference":[{"issue":"3","key":"561_CR1","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1016\/j.ejor.2006.04.042","volume":"180","author":"K A\u011fpak","year":"2007","unstructured":"A\u011fpak K, G\u00f6k\u00e7en H (2007) A chance-constrained approach to stochastic line balancing problems. Eur J Oper Res 180(3):1098\u20131115","journal-title":"Eur J Oper Res"},{"issue":"3","key":"561_CR2","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1016\/j.ejor.2004.07.026","volume":"168","author":"M Amen","year":"2006","unstructured":"Amen M (2006) Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds. Eur J Oper Res 168(3):747\u2013770","journal-title":"Eur J Oper Res"},{"issue":"4","key":"561_CR3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1080\/00207546508919982","volume":"4","author":"AL Arcus","year":"1966","unstructured":"Arcus AL (1966) COMSOAL: A computer method of sequencing operations for assembly lines. Int J Prod Res 4(4):259\u2013277","journal-title":"Int J Prod Res"},{"issue":"1","key":"561_CR4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10288-011-0182-8","volume":"10","author":"R Bai","year":"2012","unstructured":"Bai R, Blazewicz J, Burke EK, Kendall G, McCollum B (2012) A simulated annealing hyper-heuristic methodology for flexible decision support. 4OR. Q J Oper Res 10(1):43\u201366","journal-title":"Q J Oper Res"},{"key":"561_CR5","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s10845-005-6638-y","volume":"17","author":"A Baykaso\u011flu","year":"2006","unstructured":"Baykaso\u011flu A (2006) Multi-rule multi-objective simulated annealing algorithm for straight and U type assembly line balancing problems. J Intell Manuf 17:217\u2013232","journal-title":"J Intell Manuf"},{"key":"561_CR6","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s00170-014-6295-4","volume":"76","author":"A Baykaso\u011flu","year":"2015","unstructured":"Baykaso\u011flu A, \u00d6zbakir L (2015) Discovering task assignment rules for assembly line balancing via genetic programming. Int J Adv Manuf Technol 76:417\u2013434","journal-title":"Int J Adv Manuf Technol"},{"issue":"3","key":"561_CR7","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1016\/j.ejor.2004.07.023","volume":"168","author":"C Becker","year":"2006","unstructured":"Becker C, Scholl A (2006) A survey on problems and methods in generalized assembly line balancing. Eur J Oper Res 168(3):694\u2013715","journal-title":"Eur J Oper Res"},{"key":"561_CR8","doi-asserted-by":"publisher","DOI":"10.1155\/2007\/10106","author":"R Benzer","year":"2007","unstructured":"Benzer R, G\u00f6k\u00e7en H, \u00c7etinyoku\u015f T, \u00c7er\u00e7io\u011flu H (2007) A network model for parallel line balancing problem. Math Probl Eng. https:\/\/doi.org\/10.1155\/2007\/10106","journal-title":"Math Probl Eng"},{"key":"561_CR9","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s10732-011-9192-0","volume":"18","author":"B Bilgin","year":"2012","unstructured":"Bilgin B, Diemester P, Misir M, Vancroonenburg W, Vanden Berghe G (2012) One hyper-heuristic approach to two timetabling problems in health care. J Heuristics 18:401\u2013438","journal-title":"J Heuristics"},{"key":"561_CR10","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s10479-011-0927-y","volume":"207","author":"J Blazewicz","year":"2013","unstructured":"Blazewicz J, Burke EK, Kendall G, Mruczkiewicz Wojciech, Oguz Ceyda, Swiercz Aleksandra (2013) A hyper-heuristic approach to sequencing by hybridization of DNA sequences. Ann Oper Res 207:27\u201341","journal-title":"Ann Oper Res"},{"key":"561_CR11","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1016\/j.ejor.2006.10.010","volume":"2","author":"N Boysen","year":"2007","unstructured":"Boysen N, Fliedner M, Scholl A (2007) A classification of assembly line balancing problems. Eur J Oper Res 2:674\u2013693","journal-title":"Eur J Oper Res"},{"key":"561_CR12","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.ijpe.2007.02.026","volume":"111","author":"N Boysen","year":"2008","unstructured":"Boysen N, Fliedner M, Scholl A (2008) Assembly line balancing: Which model to use when? Int J Prod Econ 111:509\u2013528","journal-title":"Int J Prod Econ"},{"key":"561_CR13","first-page":"585","volume":"32","author":"J Bukchin","year":"2000","unstructured":"Bukchin J, Tzur M (2000) Design of flexible assembly line to minimize equipment cost. IIE Trans 32:585\u2013598","journal-title":"IIE Trans"},{"key":"561_CR14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ejor.2005.08.012","volume":"176","author":"E Burke","year":"2007","unstructured":"Burke E, McCollum B, Meisels A, Petrovic S, Qu R (2007) A graph-based hyper-heuristic for educational timetabling problems. Eur J Oper Res 176:177\u2013192","journal-title":"Eur J Oper Res"},{"key":"561_CR15","first-page":"449","volume-title":"A classification of hyper-heuristic approaches. Handbook of metaheuristics (International Series in Operations Research and Management Science)","author":"EK Burke","year":"2010","unstructured":"Burke EK, Hyde M, Kendall G, Ochoa G, \u00d6zcan E, Woodward J (2010) A classification of hyper-heuristic approaches. Handbook of metaheuristics (International Series in Operations Research and Management Science), vol 146. Springer, New York, pp 449\u2013468"},{"issue":"12","key":"561_CR16","doi-asserted-by":"crossref","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke EK, Gendreau M, Hyde M, Kendall G, Ochoa G, \u00d6zcan E, Qu R (2013) Hyper-heuristics: A survey of the state of the art. J Oper Res Soc 64(12):1695\u20131724","journal-title":"J Oper Res Soc"},{"key":"561_CR17","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/j.cie.2010.08.013","volume":"60","author":"B \u00c7ak\u0131r","year":"2011","unstructured":"\u00c7ak\u0131r B, Alt\u0131parmak F, Dengiz B (2011) Multi-objective optimization of a stochastic assembly line balancing: a hybrid simulated annealing algorithm. Comput Ind Eng 60:376\u2013384","journal-title":"Comput Ind Eng"},{"key":"561_CR18","unstructured":"\u00c7ercio\u011flu H (2009) New models for stochastic parallel assembly line balancing problem, Ph.D. Thesis, Gazi University Graduate School of Natural and Applied Sciences, Department of Industrial Engineering, Thesis No. 233913, Ankara, Turkey"},{"issue":"2","key":"561_CR63","first-page":"331","volume":"24","author":"H \u00c7er\u00e7io\u011flu","year":"2009","unstructured":"\u00c7er\u00e7io\u011flu H, \u00d6zcan U, G\u00f6k\u00e7en H, Toklu B (2009) A simulated annealing approcah for parallel assembly line balancing problem. J Fac Eng Archi Gazi Univ 24(2):331\u2013341","journal-title":"J Fac Eng Archi Gazi Univ"},{"key":"561_CR19","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1080\/07408170600838340","volume":"39","author":"WC Chiang","year":"2007","unstructured":"Chiang WC, Kouvelis P, Urban TL (2007) Line balancing in a just in time production environment: balancing multiple U-lines. IIE Trans 39:347\u2013359","journal-title":"IIE Trans"},{"issue":"3","key":"561_CR20","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1016\/j.ejor.2005.03.058","volume":"179","author":"KA Dowsland","year":"2007","unstructured":"Dowsland KA, Soubeiga E, Burke EK (2007) A simulated annealing hyper-heuristic for determining shipper sizes. Eur J Oper Res 179(3):759\u2013774","journal-title":"Eur J Oper Res"},{"issue":"1","key":"561_CR21","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1162\/EVCO_a_00145","volume":"24","author":"JH Drake","year":"2016","unstructured":"Drake JH, \u00d6zcan E, Burke EK (2016) A case study of controlling crossover in a selection hyper-heuristic framework using the multidimensional knapsack problem. Evol Comput 24(1):113\u2013141","journal-title":"Evol Comput"},{"key":"561_CR22","doi-asserted-by":"crossref","first-page":"1218","DOI":"10.1016\/j.cie.2009.05.014","volume":"57","author":"Y Ege","year":"2009","unstructured":"Ege Y, Azizo\u011flu M, \u00d6zdemirel NE (2009) Assembly line balancing with station paralleling. Comput Ind Eng 57:1218\u20131225","journal-title":"Comput Ind Eng"},{"key":"561_CR23","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/11546245_4","volume-title":"Hybrid Metaheuristic","author":"M El-Abd","year":"2005","unstructured":"El-Abd M, Kamel M (2005) A taxonomy of cooperative search algorithms. In: Blesa MJ, Blume C, Roli A, Samples M (eds) Hybrid Metaheuristic. Heidelberg, Germany), pp 32\u201342"},{"issue":"7","key":"561_CR24","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1080\/00207540412331320526","volume":"43","author":"E Erel","year":"2005","unstructured":"Erel E, Sabuncuo\u011flu I, \u015eekerci H (2005) Stochastic assembly line balancing using beam search. Int J Prod Res 43(7):1411\u20131426","journal-title":"Int J Prod Res"},{"key":"561_CR25","unstructured":"Fialho A (2010) Adaptive operator selection for optimization, Ph.D. Thesis, Computer Science, Universit\u00b4e Paris Sud-Paris XI"},{"issue":"6","key":"561_CR26","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1007\/s10732-010-9126-2","volume":"16","author":"P Garrido","year":"2010","unstructured":"Garrido P, Riff M (2010) Dvrp: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristics. J Heuristics 16(6):795\u2013834","journal-title":"J Heuristics"},{"issue":"2","key":"561_CR27","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":"11\u201312","key":"561_CR28","doi-asserted-by":"crossref","first-page":"1218","DOI":"10.1007\/s00170-006-0437-2","volume":"32","author":"Y Kara","year":"2007","unstructured":"Kara Y, \u00d6zcan U, Peker A (2007) An approach for balancing and sequencing mixed-model JIT U-lines. Int J Adv Manuf Technol 32(11\u201312):1218\u20131231","journal-title":"Int J Adv Manuf Technol"},{"issue":"6","key":"561_CR29","doi-asserted-by":"crossref","first-page":"1685","DOI":"10.1080\/00207540802534715","volume":"48","author":"Y Kara","year":"2010","unstructured":"Kara Y, G\u00f6k\u00e7en H, Atasagun Y (2010) Balancing parallel assembly lines with precise and fuzzy goals. Int J Prod Res 48(6):1685\u20131703","journal-title":"Int J Prod Res"},{"key":"561_CR30","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computation","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computation. Plenum Press, New York, pp 85\u2013103"},{"issue":"2","key":"561_CR31","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1080\/00207548108956640","volume":"19","author":"JF Kottas","year":"1981","unstructured":"Kottas JF, Lau HS (1981) A stochastic line balancing procedure. Int J Prod Res 19(2):177\u2013193","journal-title":"Int J Prod Res"},{"key":"561_CR32","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/j.ijpe.2014.08.010","volume":"158","author":"I K\u00fc\u00e7\u00fckko\u00e7","year":"2014","unstructured":"K\u00fc\u00e7\u00fckko\u00e7 I, Zhang DZ (2014) Mathematical model and agent-based solution approach for the simultaneous balancing and sequencing of mixed-model parallel two-sided assembly lines. Int J Prod Econ 158:314\u2013333","journal-title":"Int J Prod Econ"},{"key":"561_CR33","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.cie.2014.12.037","volume":"84","author":"I K\u00fc\u00e7\u00fckko\u00e7","year":"2015","unstructured":"K\u00fc\u00e7\u00fckko\u00e7 I, Zhang DZ (2015a) Type-E parallel two-sided assembly line balancing problem: Mathematical model and ant colony optimization based approach with optimized parameters. Comput Ind Eng 84:56\u201369","journal-title":"Comput Ind Eng"},{"key":"561_CR34","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.cor.2015.05.014","volume":"64","author":"I K\u00fc\u00e7\u00fckko\u00e7","year":"2015","unstructured":"K\u00fc\u00e7\u00fckko\u00e7 I, Zhang DZ (2015b) Balancing of parallel U-shaped assembly lines. Comput Oper Res 64:233\u2013244","journal-title":"Comput Oper Res"},{"key":"561_CR35","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.cie.2016.04.001","volume":"97","author":"I K\u00fc\u00e7\u00fckko\u00e7","year":"2016","unstructured":"K\u00fc\u00e7\u00fckko\u00e7 I, Zhang DZ (2016) Mixed-model parallel two-sided assembly line balancing problem: a flexible agent-based ant colony optimization approach. Comput Ind Eng 97:58\u201372","journal-title":"Comput Ind Eng"},{"key":"561_CR36","unstructured":"K\u00fc\u00e7\u00fckko\u00e7 I, Zhang DZ, Keedwell EC (2013a) Balancing parallel two-sided assembly lines with ant colony optimisation algorithm. In: Proceedings of the 2nd symposium on nature-inspired computing and applications (NICA) at artificial intelligence and the simulation of behavior (AISB) 2013 convention, University of Exeter, Exeter, pp 21\u201328"},{"key":"561_CR37","unstructured":"K\u00fc\u00e7\u00fckko\u00e7 I, Zhang DZ, Keedwell EC, Pakgohar A (2013b) An improved ant colony optimization algorithm for type-1 parallel two-sided assembly line balancing problem. In: The OR society YOR18 biennial conference. University of Exeter, Exeter"},{"key":"561_CR62","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.ijpe.2006.05.012","volume":"106","author":"C-H Lan","year":"2007","unstructured":"Lan C-H (2007) The design of multiple production lines under deadline constraint. Int J Prod Econ 106:191\u2013203","journal-title":"Int J Prod Econ"},{"issue":"1","key":"561_CR38","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1504\/EJIE.2008.016329","volume":"2","author":"A Lusa","year":"2008","unstructured":"Lusa A (2008) A survey of the literature on the multiple or parallel assembly line balancing problem. Eur J Ind Eng 2(1):50\u201372","journal-title":"Eur J Ind Eng"},{"key":"561_CR39","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-018-0428-8","author":"HA Mardani-Fard","year":"2018","unstructured":"Mardani-Fard HA, Hadi-Vencheh A, Mahmoodirad A, Niroomand S (2018) An efective hybrid goal programming approach for multi objective straight assembly line balancing problem with stochastic parameters. Oper Res. https:\/\/doi.org\/10.1007\/s12351-018-0428-8","journal-title":"Oper Res"},{"key":"561_CR40","doi-asserted-by":"crossref","first-page":"2717","DOI":"10.1080\/002075498192454","volume":"36","author":"P McMullen","year":"1998","unstructured":"McMullen P, Frazier G (1998) Using simulated annealing to solve a multiobjective assembly line balancing problem with parallel workstations. Int J Prod Res 36:2717\u20132741","journal-title":"Int J Prod Res"},{"issue":"7","key":"561_CR41","doi-asserted-by":"crossref","first-page":"3335","DOI":"10.1016\/j.asoc.2013.02.006","volume":"13","author":"M M\u0131s\u0131r","year":"2013","unstructured":"M\u0131s\u0131r M, Verbeeck K, Causmaecker P De, Vanden Berghe G (2013) An investigation on the generality level of selection hyper-heuristics under different empirical conditions. Appl Soft Comput 13(7):3335\u20133353","journal-title":"Appl Soft Comput"},{"key":"561_CR42","doi-asserted-by":"crossref","unstructured":"Ortis-Bayliss J, \u00d6zcan E, Parkes A, Terashima-Marin H (2010) Mapping the performance of heuristics for constraint satisfaction. IEEE congress on evolutionary computation (CEC2010), Barcelona, pp 1\u20138","DOI":"10.1109\/CEC.2010.5585965"},{"key":"561_CR43","doi-asserted-by":"crossref","first-page":"3186","DOI":"10.1016\/j.asoc.2010.12.021","volume":"11","author":"L \u00d6zbak\u0131r","year":"2011","unstructured":"\u00d6zbak\u0131r L, Baykaso\u011flu A, G\u00f6rkemli B, G\u00f6rkemli L (2011) Multiple-colony ant algorithm for parallel assembly line balancing problem. Appl Soft Comput 11:3186\u20133198","journal-title":"Appl Soft Comput"},{"key":"561_CR44","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.cor.2018.05.006","volume":"99","author":"U \u00d6zcan","year":"2018","unstructured":"\u00d6zcan U (2018) Balancing stochastic parallel assembly lines. Comput Oper Res 99:109\u2013122","journal-title":"Comput Oper Res"},{"issue":"4","key":"561_CR45","first-page":"313","volume":"22","author":"U \u00d6zcan","year":"2009","unstructured":"\u00d6zcan U, \u00c7er\u00e7io\u011flu H, G\u00f6k\u00e7en H, Toklu B (2009) A tabu search algorithm for the parallel assembly line balancing problem. Gazi Univ J Sci 22(4):313\u2013323","journal-title":"Gazi Univ J Sci"},{"issue":"17","key":"561_CR46","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":"3","key":"561_CR47","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1080\/00207543.2015.1108534","volume":"54","author":"M Ritt","year":"2016","unstructured":"Ritt M, Costa AM, Miralles C (2016) The assembly line worker assignment and balancing problem with stochastic worker availability. Int J Prod Res 54(3):907\u2013922","journal-title":"Int J Prod Res"},{"key":"561_CR48","first-page":"477","volume":"36","author":"O Rosenberg","year":"1992","unstructured":"Rosenberg O, Ziegler H (1992) A comparison of heuristic algorithms for cost-oriented assembly line balancing. Zeitschrift f\u00fcr Oper Res 36:477\u2013495","journal-title":"Zeitschrift f\u00fcr Oper Res"},{"issue":"2\u20133","key":"561_CR49","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1080\/0951192X.2016.1145802","volume":"30","author":"U Saif","year":"2017","unstructured":"Saif U, Guan Z, Zhang L, Mirza J, Lei Y (2017) Hybrid pareto artificial bee colony algorithm for assembly line balancing with task time variations. Int J Comput Integr Manuf 30(2\u20133):255\u2013270","journal-title":"Int J Comput Integr Manuf"},{"key":"561_CR50","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/S0305-0483(99)00016-X","volume":"27","author":"S Sarin","year":"1999","unstructured":"Sarin S, Erel E, Dar-El E (1999) A methodology for solving single-model, stochastic assembly line balancing problem. Omega 27:525\u2013535","journal-title":"Omega"},{"key":"561_CR51","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1016\/j.ejor.2004.07.022","volume":"168","author":"A Scholl","year":"2006","unstructured":"Scholl A, Becker C (2006) State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. Eur J Oper Res 168:666\u2013693","journal-title":"Eur J Oper Res"},{"issue":"1","key":"561_CR52","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.ijpe.2009.01.011","volume":"119","author":"A Scholl","year":"2009","unstructured":"Scholl A, Boysen N (2009) Designing parallel assembly lines with split workplaces: model and optimization procedure. Int J Prod Econ 119(1):90\u2013100","journal-title":"Int J Prod Econ"},{"issue":"3","key":"561_CR53","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0360-8352(90)90050-V","volume":"18","author":"D Shin","year":"1990","unstructured":"Shin D (1990) An Efficient heuristic for solving stochastic assembly line balancing problems. Comput Ind Eng 18(3):285\u2013295","journal-title":"Comput Ind Eng"},{"key":"561_CR54","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/mnsc.32.4.455","volume":"32","author":"F Silverman","year":"1986","unstructured":"Silverman F, Carter J (1986) A cost-based methodology for stochastic line balancing with intermittent line stoppages. Manage Sci 32:455\u2013463","journal-title":"Manage Sci"},{"issue":"3\u20134","key":"561_CR55","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/S0360-8352(98)00135-1","volume":"35","author":"GA S\u00fcer","year":"1998","unstructured":"S\u00fcer GA (1998) Designing parallel assembly lines. Comput Ind Eng 35(3\u20134):467\u2013470","journal-title":"Comput Ind Eng"},{"key":"561_CR56","doi-asserted-by":"crossref","first-page":"1801","DOI":"10.1080\/00207549408957042","volume":"32","author":"G Suresh","year":"1994","unstructured":"Suresh G, Sahu S (1994) Stochastic assembly line balancing using simulated annealing. Int J Prod Res 32:1801\u20131810","journal-title":"Int J Prod Res"},{"key":"561_CR57","volume-title":"Introduction to quality engineering: designing quality into products and processes","author":"G Taguchi","year":"1986","unstructured":"Taguchi G (1986) Introduction to quality engineering: designing quality into products and processes. Asian Productivity Organization\/UNIPUB, White Plain"},{"key":"561_CR58","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1023\/A:1016540724870","volume":"8","author":"EG Talbi","year":"2002","unstructured":"Talbi EG (2002) A taxonomy of hybrid metaheuristics. J Heuristics 8:541\u2013564","journal-title":"J Heuristics"},{"issue":"275\u2013291","key":"561_CR59","first-page":"2016","volume":"39","author":"P Tapkan","year":"2016","unstructured":"Tapkan P, \u00d6zbakir L, Baykaso\u011flu A (2016) Bee algorithms for parallel two-sided assembly line balancing problem with walking times. Appl Soft Comput 39(275\u2013291):2016","journal-title":"Appl Soft Comput"},{"issue":"1","key":"561_CR60","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s10479-008-0475-2","volume":"179","author":"H Terashima-Marin","year":"2009","unstructured":"Terashima-Marin H, Ross P, Farias-Zarate C, Lopez-Camacho E, Valenzuela-Rendon M (2009) Generalized hyper-heuristics for solving regular and irregular bin packing problems. Ann Oper Res 179(1):369\u2013392","journal-title":"Ann Oper Res"},{"issue":"6","key":"561_CR61","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1007\/s10732-009-9120-8","volume":"16","author":"J Vazquez-Rodriguez","year":"2010","unstructured":"Vazquez-Rodriguez J, Petrovic S (2010) A new dispatching rule based genetic algorithm for the multi-objective job shop problem. J Heuristics 16(6):771\u2013793","journal-title":"J Heuristics"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-020-00561-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-020-00561-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-020-00561-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,25]],"date-time":"2022-02-25T06:25:02Z","timestamp":1645770302000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-020-00561-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,31]]},"references-count":63,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["561"],"URL":"https:\/\/doi.org\/10.1007\/s12351-020-00561-x","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,31]]},"assertion":[{"value":"3 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}