{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T16:34:45Z","timestamp":1776184485175,"version":"3.50.1"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2023,2,23]],"date-time":"2023-02-23T00:00:00Z","timestamp":1677110400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,23]],"date-time":"2023-02-23T00:00:00Z","timestamp":1677110400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["30922011406"],"award-info":[{"award-number":["30922011406"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"System Science and Enterprise Development Research Center","award":["Xq22B06"],"award-info":[{"award-number":["Xq22B06"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s00500-023-07846-1","type":"journal-article","created":{"date-parts":[[2023,2,23]],"date-time":"2023-02-23T01:27:36Z","timestamp":1677115656000},"page":"6415-6436","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["An exact branch-and-bound algorithm for seru scheduling problems with sequence-dependent setup time"],"prefix":"10.1007","volume":"27","author":[{"given":"Xiaohong","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8029-9679","authenticated-orcid":false,"given":"Zhe","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xue","family":"Gong","sequence":"additional","affiliation":[]},{"given":"Yong","family":"Yin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"issue":"1","key":"7846_CR1","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1016\/j.ejor.2015.01.013","volume":"244","author":"M Abdeljaouad","year":"2015","unstructured":"Abdeljaouad M, Bahroun Z, Omrane A, Fondrevelle J (2015) Job-shop production scheduling with reverse flows. Eur J Oper Res 244(1):1117\u20131128. https:\/\/doi.org\/10.1016\/j.ejor.2015.01.013","journal-title":"Eur J Oper Res"},{"key":"7846_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104793","author":"L Abreu","year":"2020","unstructured":"Abreu L, Cunha J, Prata B, Framinan J (2020) A genetic algorithm for scheduling open shops with sequence-dependent setup times. Comput Oper Res. https:\/\/doi.org\/10.1016\/j.cor.2019.104793","journal-title":"Comput Oper Res"},{"issue":"2","key":"7846_CR3","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10845-015-1117-6","volume":"29","author":"M Afzalirad","year":"2018","unstructured":"Afzalirad M, Shafipour M (2018) Design of an efficient genetic algorithm for resource-constrained unrelated parallel machine scheduling problem with machine eligibility restrictions. J Intell Manuf 29(2):423\u2013437. https:\/\/doi.org\/10.1007\/s10845-015-1117-6","journal-title":"J Intell Manuf"},{"issue":"1","key":"7846_CR4","first-page":"29","volume":"51","author":"S Akino","year":"1997","unstructured":"Akino S (1997) Internationalization of Japanese company and change of production system. Rikkyo Econ Rev 51(1):29\u201355 (in Japanese)","journal-title":"Rikkyo Econ Rev"},{"issue":"2","key":"7846_CR5","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.ejor.2015.04.004","volume":"246","author":"A Allahverdi","year":"2015","unstructured":"Allahverdi A (2015) The third comprehensive survey on scheduling problems with setup times\/costs. Eur J Oper Res 246(2):345\u2013378. https:\/\/doi.org\/10.1016\/j.ejor.2015.04.004","journal-title":"Eur J Oper Res"},{"issue":"3","key":"7846_CR6","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1016\/j.ejor.2006.09.010","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi A, Soroush H (2008) The significance of reducing setup times\/setup costs. Eur J Oper Res 187(3):978\u2013984. https:\/\/doi.org\/10.1016\/j.ejor.2006.09.010","journal-title":"Eur J Oper Res"},{"issue":"2","key":"7846_CR7","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","volume":"27","author":"A Allahverdi","year":"1999","unstructured":"Allahverdi A, Gupta J, Aldowaisan T (1999) A review of scheduling research involving setup considerations. Omega-Int J Manag Sci 27(2):219\u2013239. https:\/\/doi.org\/10.1016\/S0305-0483(98)00042-5","journal-title":"Omega-Int J Manag Sci"},{"issue":"3","key":"7846_CR8","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi A, Ng C, Cheng T, Kovalyov M (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187(3):985\u20131032. https:\/\/doi.org\/10.1016\/j.ejor.2006.06.060","journal-title":"Eur J Oper Res"},{"issue":"1","key":"7846_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0377-2217(89)90349-4","volume":"39","author":"G Buxey","year":"1989","unstructured":"Buxey G (1989) Production scheduling: practice and theory. Eur J Oper Res 39(1):17\u201331. https:\/\/doi.org\/10.1016\/0377-2217(89)90349-4","journal-title":"Eur J Oper Res"},{"key":"7846_CR10","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.cie.2017.11.020","volume":"115","author":"W Cui","year":"2018","unstructured":"Cui W, Lu Z, Li C, Han X (2018) A proactive approach to solve integrated production scheduling and maintenance planning problem in flow shops. Comput Ind Eng 115:342\u2013353. https:\/\/doi.org\/10.1016\/j.cie.2017.11.020","journal-title":"Comput Ind Eng"},{"key":"7846_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmse.2020.10.002","author":"Y Gai","year":"2020","unstructured":"Gai Y, Yin Y, Tang J, Liu S (2020) Minimizing makespan of a production batch within concurrent systems: Seru production perspective. J Manag Sci Eng. https:\/\/doi.org\/10.1016\/j.jmse.2020.10.002","journal-title":"J Manag Sci Eng"},{"issue":"1","key":"7846_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-019-00630-w","volume":"23","author":"S Gawiejnowicz","year":"2020","unstructured":"Gawiejnowicz S (2020) A review of four decades of time-dependent scheduling: main results, new topics, and open problems. J Sched 23(1):3\u201347. https:\/\/doi.org\/10.1007\/s10951-019-00630-w","journal-title":"J Sched"},{"issue":"3","key":"7846_CR13","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1016\/j.ejor.2020.01.039","volume":"284","author":"J Gmys","year":"2020","unstructured":"Gmys J, Mezmaz M, Melab N, Tuyttens D (2020) A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem. Eur J Oper Res 284(3):814\u2013833. https:\/\/doi.org\/10.1016\/j.ejor.2020.01.039","journal-title":"Eur J Oper Res"},{"issue":"3","key":"7846_CR14","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1080\/00207543.2011.649801","volume":"284","author":"J Gmys","year":"2020","unstructured":"Iranpoor M, Fatemi S, Zandieh G (2012) Machine scheduling in the presence of sequence-dependent setup times and a rate-modifying activity. Int J Prod Res 50(24):7401\u20137414. https:\/\/doi.org\/10.1080\/00207543.2011.649801","journal-title":"Eur J Oper Res"},{"key":"7846_CR15","unstructured":"Japan Machinery Federation (2005) Changes on manufacturing system and technologies. Japan Machinery Federation, Japan. (in Japanese)"},{"issue":"1","key":"7846_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"S Johnson","year":"1954","unstructured":"Johnson S (1954) Optimal two-and three-stage production schedules with setup times included. Nav Res Logist 1(1):61\u201368. https:\/\/doi.org\/10.1002\/nav.3800010110","journal-title":"Nav Res Logist"},{"issue":"8","key":"7846_CR17","doi-asserted-by":"publisher","first-page":"2055","DOI":"10.1080\/00207540802275889","volume":"47","author":"I Kaku","year":"2009","unstructured":"Kaku I, Gong J, Tang J, Yin Y (2009) Modelling and numerical analysis of line-cell conversion problems. Int J Prod Res 47(8):2055\u20132078. https:\/\/doi.org\/10.1080\/00207540802275889","journal-title":"Int J Prod Res"},{"key":"7846_CR18","doi-asserted-by":"crossref","unstructured":"Karlof JK (Ed) (2005) Integer programming: theory and practice. CRC Press","DOI":"10.1201\/9781420039597"},{"issue":"1","key":"7846_CR19","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/S0377-2217(03)00401-6","volume":"159","author":"M Kurz","year":"2004","unstructured":"Kurz M, Askin R (2004) Scheduling flexible flow lines with sequence- dependent setup times. Eur J Oper Res 159(1):66\u201382. https:\/\/doi.org\/10.1016\/S0377-2217(03)00401-6","journal-title":"Eur J Oper Res"},{"key":"7846_CR20","doi-asserted-by":"publisher","DOI":"10.4324\/9781351034982","volume-title":"Operations management: a research overview","author":"M Lewis","year":"2019","unstructured":"Lewis M (2019) Operations management: a research overview. Routledge, London"},{"key":"7846_CR21","unstructured":"Lian J (2018) Seru production flexibility analysis and robust system construction. Xi\u2019an University of Technology. (in Chinese)"},{"issue":"14","key":"7846_CR22","first-page":"260","volume":"37","author":"J Lian","year":"2017","unstructured":"Lian J, Liu C (2017) Research on order dispatching problem in view of multi-attribute matching. Sci Technol Manag Res 37(14):260\u2013266 (in Chinese)","journal-title":"Sci Technol Manag Res"},{"key":"7846_CR23","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1016\/j.cie.2018.02.035","volume":"118","author":"J Lian","year":"2018","unstructured":"Lian J, Liu C, Li W, Yin Y (2018) A multi-skilled worker assignment problem in seruproduction systems considering the worker heterogeneity. Comput Ind Eng 118:366\u2013382. https:\/\/doi.org\/10.1016\/j.cie.2018.02.035","journal-title":"Comput Ind Eng"},{"issue":"3","key":"7846_CR24","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/j.jmsy.2012.02.003","volume":"31","author":"C Liu","year":"2012","unstructured":"Liu C, Li W, Lian J, Yin Y (2012) Reconfiguration of assembly systems: from conveyor assembly line to serus. J Manuf Syst 31(3):312\u2013325. https:\/\/doi.org\/10.1016\/j.jmsy.2012.02.003","journal-title":"J Manuf Syst"},{"issue":"2","key":"7846_CR25","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1080\/19761597.2010.9668694","volume":"18","author":"C Liu","year":"2010","unstructured":"Liu C, Lian J, Yin Y, Li W (2010a) Seru seisan-an innovation of the production management mode in Japan. Asian J Technol Innov 18(2):89\u2013113. https:\/\/doi.org\/10.1080\/19761597.2010.9668694","journal-title":"Asian J Technol Innov"},{"issue":"05","key":"7846_CR26","first-page":"93","volume":"22","author":"C Liu","year":"2010","unstructured":"Liu C, Lian J, Yin Y, Li W (2010b) Seru Seisan-the latest manufacturing model developed in Japan. Manag Rev 22(05):93\u2013103 (in Chinese)","journal-title":"Manag Rev"},{"issue":"1","key":"7846_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/itor.12014","volume":"21","author":"C Liu","year":"2014","unstructured":"Liu C, Stecke K, Lian J, Yin Y (2014) An implementation framework for seru production. Int Trans Oper Res 21(1):1\u201319. https:\/\/doi.org\/10.1111\/itor.12014","journal-title":"Int Trans Oper Res"},{"issue":"5\u20138","key":"7846_CR28","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1007\/s00170-013-5027-5","volume":"69","author":"C Liu","year":"2013","unstructured":"Liu C, Yang N, Li W, Lian J, Evans S, Yin Y (2013) Training and assignment of multi-skilled workers for implementing seruproduction systems. Int J Adv Manuf Technol 69(5\u20138):937\u2013959. https:\/\/doi.org\/10.1007\/s00170-013-5027-5","journal-title":"Int J Adv Manuf Technol"},{"key":"7846_CR29","doi-asserted-by":"publisher","unstructured":"Luo L, Zhang Z, Yin Y (2016) Seru loading with worker- operation assignment in single period. In: 2016 IEEE international conference on industrial engineering and engineering management (IEEM), pp 1055\u20131058. https:\/\/doi.org\/10.1109\/IEEM.2016.7798039.","DOI":"10.1109\/IEEM.2016.7798039"},{"issue":"2","key":"7846_CR30","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1504\/EJIE.2017.083255","volume":"11","author":"L Luo","year":"2017","unstructured":"Luo L, Zhang Z, Yin Y (2017) Modelling and numerical analysis of seru loading problem under uncertainty. Eur J Ind Eng 11(2):185\u2013204. https:\/\/doi.org\/10.1504\/EJIE.2017.083255","journal-title":"Eur J Ind Eng"},{"issue":"2","key":"7846_CR31","doi-asserted-by":"publisher","first-page":"779","DOI":"10.3934\/jimo.2019134","volume":"17","author":"L Luo","year":"2021","unstructured":"Luo L, Zhang Z, Yin Y (2021) Simulated annealing and genetic algorithm based method for a bi-level seru loading problem with worker assignment in seru production systems. J Ind Manag Optim 17(2):779\u2013803. https:\/\/doi.org\/10.3934\/jimo.2019134","journal-title":"J Ind Manag Optim"},{"issue":"4","key":"7846_CR32","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1504\/IJATM.2006.012234","volume":"6","author":"D Miyake","year":"2006","unstructured":"Miyake D (2006) The shift from belt conveyor line to work-cell based assembly systems to cope with increasing demand variation in Japanese industries. Int J Automot Technol Manag 6(4):419\u2013439. https:\/\/doi.org\/10.1504\/IJATM.2006.012234","journal-title":"Int J Automot Technol Manag"},{"issue":"12","key":"7846_CR33","doi-asserted-by":"publisher","first-page":"3476","DOI":"10.1080\/00207543.2012.746480","volume":"51","author":"M Mousakhani","year":"2013","unstructured":"Mousakhani M (2013) Sequence-dependent setup time flexible job shop scheduling problem to minimise total tardiness. Int J Prod Res 51(12):3476\u20133487. https:\/\/doi.org\/10.1080\/00207543.2012.746480","journal-title":"Int J Prod Res"},{"issue":"3","key":"7846_CR34","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1016\/j.ejor.20-08.10.010","volume":"198","author":"M Reimann","year":"2008","unstructured":"Reimann M, Schiltknecht P (2008) Studying the interdependence of contractual and operational flexibilities in the market of specialty chemicals. EurJ Oper Res 198(3):760\u2013772. https:\/\/doi.org\/10.1016\/j.ejor.20-08.10.010","journal-title":"EurJ Oper Res"},{"key":"7846_CR35","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/4036794","author":"H Ren","year":"2019","unstructured":"Ren H, Wang D (2019) Analysis of the effect of the line-seru conversion on the waiting time with batch arrival. Math Probl Eng. https:\/\/doi.org\/10.1155\/2019\/4036794","journal-title":"Math Probl Eng"},{"issue":"4","key":"7846_CR36","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1016\/j.cor.2006.07.015","volume":"35","author":"P Rocha","year":"2008","unstructured":"Rocha P, Ravetti M, Mateus G, Pardalos P (2008) Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times. Comput Oper Res 35(4):1250\u20131264. https:\/\/doi.org\/10.1016\/j.cor.2006.07.015","journal-title":"Comput Oper Res"},{"issue":"9","key":"7846_CR37","doi-asserted-by":"publisher","first-page":"1473","DOI":"10.1111\/poms.12590","volume":"25","author":"A Roth","year":"2016","unstructured":"Roth A, Singhal J, Singhal K, Tang S (2016) Knowledge creation and dissemination in operations and supply chain management. Prod Oper Manag 25(9):1473\u20131488. https:\/\/doi.org\/10.1111\/poms.12590","journal-title":"Prod Oper Manag"},{"issue":"6","key":"7846_CR38","doi-asserted-by":"publisher","first-page":"341","DOI":"10.11221\/jima.55.341","volume":"55","author":"Y Sakazume","year":"2005","unstructured":"Sakazume Y (2005) Is Japanese cell manufacturing a new system?: a comparative study between Japanese cell manufacturing and cellular manufacturing (production and logistics). J Jpn Ind Manage Assoc 55(6):341\u2013349. https:\/\/doi.org\/10.11221\/jima.55.341","journal-title":"J Jpn Ind Manage Assoc"},{"key":"7846_CR39","volume-title":"The organizing principles of assembly cells","author":"Y Sakazume","year":"2012","unstructured":"Sakazume Y (2012) The organizing principles of assembly cells. Keio University Press, Tokyo ((in Japanese))"},{"issue":"4","key":"7846_CR40","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1504\/IJMR.2016.082821","volume":"11","author":"L Shao","year":"2016","unstructured":"Shao L, Zhang Z, Yin Y (2016) A bi-objective combination optimisation model for line-seru conversion based on queuing theory. Int J Manuf Res 11(4):322\u2013338. https:\/\/doi.org\/10.1504\/IJMR.2016.082821","journal-title":"Int J Manuf Res"},{"issue":"2","key":"7846_CR41","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.ejor.2017.08.021","volume":"265","author":"L Shen","year":"2018","unstructured":"Shen L, Dauz\u00e8re-P\u00e9r\u00e8s S, Neufeld J (2018) Solving the flexible job shop scheduling problem with sequence-dependent setup times. Eur J Oper Res 265(2):503\u2013516. https:\/\/doi.org\/10.1016\/j.ejor.2017.08.021","journal-title":"Eur J Oper Res"},{"issue":"1","key":"7846_CR42","doi-asserted-by":"publisher","first-page":"106","DOI":"10.4018\/jsds.2012010104","volume":"3","author":"K Stecke","year":"2012","unstructured":"Stecke K, Yin Y, Kaku I, Murase Y (2012) Seru: The organizational extension of JIT for a super-talent factory. Int J Strat Decis Sci 3(1):106\u2013119. https:\/\/doi.org\/10.4018\/jsds.2012010104","journal-title":"Int J Strat Decis Sci"},{"issue":"21","key":"7846_CR43","doi-asserted-by":"publisher","first-page":"6441","DOI":"10.1080\/00207543.2019.1680898","volume":"58","author":"W Sun","year":"2020","unstructured":"Sun W, Yu Y, Lou Q, Wang J, Guan Y (2020) Reducing the total tardiness by Seru production: model, exact and cooperative coevolution solutions. Int J Prod Res 58(21):6441\u20136452. https:\/\/doi.org\/10.1080\/00207543.2019.1680898","journal-title":"Int J Prod Res"},{"issue":"03","key":"7846_CR44","first-page":"52","volume":"35","author":"W Tang","year":"2014","unstructured":"Tang W, Yang H, Li Z, Guo J, Zhang S (2014) Non-identical parallel machine scheduling problem with energy and a tardiness cost. Software 35(03):52\u201357 (in Chinese)","journal-title":"Software"},{"issue":"3","key":"7846_CR45","doi-asserted-by":"publisher","first-page":"20170231","DOI":"10.1515\/ijeeps-2017-0231","volume":"19","author":"N Theodorakatos","year":"2018","unstructured":"Theodorakatos N (2018) Optimal phasor measurement unit placement for numerical observability using a two-phase branch-and-bound algorithm. Int J Emerg Electr Power Syst 19(3):20170231. https:\/\/doi.org\/10.1515\/ijeeps-2017-0231","journal-title":"Int J Emerg Electr Power Syst"},{"issue":"4\u20135","key":"7846_CR46","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1080\/15325008.2019.1605635","volume":"47","author":"NP Theodorakatos","year":"2019","unstructured":"Theodorakatos NP (2019) Optimal phasor measurement unit placement for numerical observability using branch-and-bound and a binary-coded genetic algorithm. Electr Power Compon Syst 47(4\u20135):357\u2013371. https:\/\/doi.org\/10.1080\/15325008.2019.1605635","journal-title":"Electr Power Compon Syst"},{"issue":"7","key":"7846_CR47","doi-asserted-by":"publisher","first-page":"1724","DOI":"10.3390\/en13071724","volume":"13","author":"NP Theodorakatos","year":"2020","unstructured":"Theodorakatos NP, Lytras M, Babu R (2020) Towards smart energy grids: a box-constrained nonlinear underdetermined model for power system observability using recursive quadratic programming. Energies 13(7):1724. https:\/\/doi.org\/10.3390\/en13071724","journal-title":"Energies"},{"issue":"4","key":"7846_CR48","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1080\/15325008.2014.981319","volume":"43","author":"NP Theodorakatos","year":"2015","unstructured":"Theodorakatos NP, Manousakis NM, Korres GN (2015) Optimal placement of phasor measurement units with linear and non-linear models. Electr Power Compon Syst 43(4):357\u2013373. https:\/\/doi.org\/10.1080\/15325008.2014.981319","journal-title":"Electr Power Compon Syst"},{"key":"7846_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jom.2017.02.001","volume":"49\u201351","author":"S Treville","year":"2017","unstructured":"Treville S, Ketokivi M, Singhal V (2017) Competitive manufacturing in a high-cost environment: Introduction to the special issue. J Oper Manag 49\u201351:1\u20135. https:\/\/doi.org\/10.1016\/j.jom.2017.02.001","journal-title":"J Oper Manag"},{"key":"7846_CR50","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1111\/j.1937-5956.2005.tb00019.x","volume":"14","author":"S Trovinger","year":"2005","unstructured":"Trovinger S, Bohn R (2005) Setup time reduction for electronics assembly: combining simple (SMED) and IT-based methods. Prod Oper Manag 14:205\u2013217. https:\/\/doi.org\/10.1111\/j.1937-5956.2005.tb00019.x","journal-title":"Prod Oper Manag"},{"issue":"4","key":"7846_CR51","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s115180185379-3","volume":"27","author":"Y Wang","year":"2018","unstructured":"Wang Y, Tang J (2018) Cost and service-level-based model for a seru production system formation problem with uncertain demand. J Syst Sci Syst Eng 27(4):519\u2013537. https:\/\/doi.org\/10.1007\/s115180185379-3","journal-title":"J Syst Sci Syst Eng"},{"key":"7846_CR52","unstructured":"Weekly Toyo Keizai (2003) Not only Toyota-Miraculous Canon manufacturing system. Weekly Toyo Keizai, Japan. (in Japanese)"},{"key":"7846_CR53","doi-asserted-by":"publisher","first-page":"50","DOI":"10.3901\/JME.2006.08.050","volume":"8","author":"H Xiong","year":"2006","unstructured":"Xiong H, Li J, Kong J, Yang J, Jiang G (2006) Heuristic method for dynamic job shop scheduling problem with operation relativity. Chin J Mech Eng 8:50\u201355 (in Chinese)","journal-title":"Chin J Mech Eng"},{"issue":"4","key":"7846_CR54","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1016\/j.cie.2008.09.004","volume":"56","author":"V Yaurima","year":"2009","unstructured":"Yaurima V, Burtseva L, Tchernykh A (2009) Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers. Comput Ind Eng 56(4):1452\u20131463. https:\/\/doi.org\/10.1016\/j.cie.2008.09.004","journal-title":"Comput Ind Eng"},{"key":"7846_CR55","unstructured":"Yin Y, Stecke KE, Swink M, Kaku I (2012) Integrating lean and agile productionin a highly volatile environment with seru production systems: sony and Canon casestudies. Working paper, Yamagata University, Japan. (in Japanese)"},{"key":"7846_CR56","doi-asserted-by":"publisher","first-page":"27","DOI":"10.4135\/9781526462060","volume":"2","author":"Y Yin","year":"2008","unstructured":"Yin Y, Stecke K, Kaku I (2008) The evolution of seru production systems throughout Canon. Oper Manag Educ Rev 2:27\u201340. https:\/\/doi.org\/10.4135\/9781526462060","journal-title":"Oper Manag Educ Rev"},{"issue":"1\u20132","key":"7846_CR57","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1080\/00207543.2017.1403664","volume":"56","author":"Y Yin","year":"2018","unstructured":"Yin Y, Stecke K, Li D (2018) The evolution of production systems from industry 2.0 through Industry 4.0. Int J Prod Res 56(1\u20132):848\u2013861. https:\/\/doi.org\/10.1080\/00207543.2017.1403664","journal-title":"Int J Prod Res"},{"key":"7846_CR58","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.jom.2017.01.003","volume":"49\u201351","author":"Y Yin","year":"2017","unstructured":"Yin Y, Stecke K, Swink M, Kaku I (2017) Lessons from seru production on manufacturing competitively in a high cost environment. J Oper Manag 49\u201351:67\u201376. https:\/\/doi.org\/10.1016\/j.jom.2017.01.003","journal-title":"J Oper Manag"},{"key":"7846_CR59","volume-title":"Seru production mode","author":"Y Yu","year":"2018","unstructured":"Yu Y, Tang J (2018) Seru production mode. Science Press, Beijing (in Chinese)"},{"issue":"2","key":"7846_CR60","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s42524-019-0028-1","volume":"6","author":"Y Yu","year":"2019","unstructured":"Yu Y, Tang J (2019) Review of seru production. Front Eng Manag 6(2):183\u2013192. https:\/\/doi.org\/10.1007\/s42524-019-0028-1","journal-title":"Front Eng Manag"},{"key":"7846_CR61","volume-title":"Design and optimization of seru production system","author":"Y Yu","year":"2020","unstructured":"Yu Y, Tang J (2020) Design and optimization of seru production system. Science Press, BeiJing (in Chinese)"},{"issue":"18","key":"7846_CR62","doi-asserted-by":"publisher","first-page":"5259","DOI":"10.1080\/00207543.2012.693642","volume":"50","author":"Y Yu","year":"2012","unstructured":"Yu Y, Gong J, Tang J, Yin Y, Kaku I (2012) How to do assembly line-cell conversion? a discussion based on factor analysis of system performance improvements. Int J Prod Res 50(18):5259\u20135280. https:\/\/doi.org\/10.1080\/00207543.2012.693642","journal-title":"Int J Prod Res"},{"issue":"10","key":"7846_CR63","doi-asserted-by":"publisher","first-page":"2990","DOI":"10.1080\/00207543.2017.1284359","volume":"55","author":"Y Yu","year":"2017","unstructured":"Yu Y, Sun W, Tang J, Kaku I, Wang J (2017a) Line-seru conversion towards reducing worker(s) without increasing makespan: models, exact and meta-heuristic solutions. Int J Prod Res 55(10):2990\u20133007. https:\/\/doi.org\/10.1080\/00207543.2017.1284359","journal-title":"Int J Prod Res"},{"key":"7846_CR64","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.cie.2016.11.035","volume":"103","author":"Y Yu","year":"2017","unstructured":"Yu Y, Sun W, Tang J, Wang J (2017b) Line-hybrid seru system conversion: models, complexities, properties, solutions and insights. Comput Ind Eng 103:282\u2013299. https:\/\/doi.org\/10.1016\/j.cie.2016.11.035","journal-title":"Comput Ind Eng"},{"issue":"2","key":"7846_CR65","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1016\/j.ejor.2014.01.029","volume":"236","author":"Y Yu","year":"2014","unstructured":"Yu Y, Tang J, Gong J, Yin Y, Kaku I (2014) Mathematical analysis and solutions for multi-objective line-cell conversion problem. Eur J Oper Res 236(2):774\u2013786. https:\/\/doi.org\/10.1016\/j.ejor.2014.01.029","journal-title":"Eur J Oper Res"},{"issue":"2","key":"7846_CR66","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1016\/j.ijpe.2013.06.009","volume":"145","author":"Y Yu","year":"2013","unstructured":"Yu Y, Tang J, Sun W, Yin Y, Kaku I (2013) Reducing worker(s) by converting assembly line into a pure cell system. Int J Prod Econ 145(2):799\u2013806. https:\/\/doi.org\/10.1016\/j.ijpe.2013.06.009","journal-title":"Int J Prod Econ"},{"issue":"2","key":"7846_CR67","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1504\/AJMSA.2015.075337","volume":"2","author":"Y Yu","year":"2015","unstructured":"Yu Y, Tang J, Yin Y, Kaku I (2015) Comparison of two typical scheduling rules of line-seru conversion problem. Asian J Manag Sci Appl 2(2):154\u2013170. https:\/\/doi.org\/10.1504\/AJMSA.2015.075337","journal-title":"Asian J Manag Sci Appl"},{"key":"7846_CR68","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.omega.2016.-01.013","volume":"66","author":"X Zhang","year":"2017","unstructured":"Zhang X, Liu C, Li W, Evans S, Yin Y (2017) Effects of key enabling technologies for seru production on sustainable performance. Omega 66:290\u2013307. https:\/\/doi.org\/10.1016\/j.omega.2016.-01.013","journal-title":"Omega"},{"key":"7846_CR69","doi-asserted-by":"publisher","first-page":"102581","DOI":"10.1016\/j.omega.2021.102581","volume":"108","author":"Z Zhang","year":"2022","unstructured":"Zhang Z, Gong X, Song X, Yin Y, Lev B, Chen J (2022a) A column generation-based exact solution method for seru scheduling problems. Omega 108:102581. https:\/\/doi.org\/10.1016\/j.omega.2021.102581","journal-title":"Omega"},{"key":"7846_CR70","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1007\/s10479-021-04515-0","volume":"312","author":"Z Zhang","year":"2022","unstructured":"Zhang Z, Song X, Huang H, Yin Y, Lev B (2022b) Scheduling problem in seru production system considering DeJong\u2019s learning effect and job splitting. Ann Oper Res 312:1119\u20131141. https:\/\/doi.org\/10.1007\/s10479-021-04515-0","journal-title":"Ann Oper Res"},{"key":"7846_CR71","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1016\/j.ejor.2021.06.017","volume":"297","author":"Z Zhang","year":"2022","unstructured":"Zhang Z, Song XL, Huang HJ, Zhou XY, Yin Y (2022c) Logic-based Benders decomposition method for the seru scheduling problem with sequence-dependent setup time and DeJong\u2019s learning effect. Eur J Oper Res 297:866\u2013877. https:\/\/doi.org\/10.1016\/j.ejor.2021.06.017","journal-title":"Eur J Oper Res"},{"key":"7846_CR72","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1002\/nav.22078","volume":"69","author":"Z Zhang","year":"2022","unstructured":"Zhang Z, Song X, Gong X, Yin Y, Lev B, Zhou X (2022d) An exact quadratic programming approach based on convex reformulation for seru scheduling problems. Nav Res Logist 69:1096\u20131107. https:\/\/doi.org\/10.1002\/nav.22078","journal-title":"Nav Res Logist"},{"issue":"8","key":"7846_CR73","doi-asserted-by":"publisher","first-page":"1800","DOI":"10.1080\/01605682.2021.1939172","volume":"73","author":"Z Zhang","year":"2022","unstructured":"Zhang Z, Wang L, Song X, Huang H, Yin Y (2022e) Improved genetic-simulated annealing algorithm for seru loading problem with downward substitution under stochastic environment. J Oper Res Soc 73(8):1800\u20131811. https:\/\/doi.org\/10.1080\/01605682.2021.1939172","journal-title":"J Oper Res Soc"},{"key":"7846_CR74","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2022.2054744","author":"Z Zhang","year":"2022","unstructured":"Zhang Z, Song X, Gong X, Yin Y, Lev B, Zhou X (2022f) An effective heuristic based on 3-opt strategy for seru scheduling problems with learning effect. Int J Prod Res. https:\/\/doi.org\/10.1080\/00207543.2022.2054744","journal-title":"Int J Prod Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-07846-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-023-07846-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-07846-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,21]],"date-time":"2023-04-21T00:16:49Z","timestamp":1682036209000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-023-07846-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,23]]},"references-count":74,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["7846"],"URL":"https:\/\/doi.org\/10.1007\/s00500-023-07846-1","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-937151\/v1","asserted-by":"object"}]},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,23]]},"assertion":[{"value":"15 January 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2023","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 article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}