{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T03:15:14Z","timestamp":1775099714722,"version":"3.50.1"},"reference-count":53,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71401075"],"award-info":[{"award-number":["71401075"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71801129"],"award-info":[{"award-number":["71801129"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"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"}]},{"DOI":"10.13039\/501100013804","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013804","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1016\/j.asoc.2023.110354","type":"journal-article","created":{"date-parts":[[2023,4,28]],"date-time":"2023-04-28T12:30:39Z","timestamp":1682685039000},"page":"110354","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":18,"special_numbering":"C","title":["A bi-level nested heuristic algorithm for divisional seru order acceptance and scheduling problems"],"prefix":"10.1016","volume":"143","author":[{"given":"Lili","family":"Wang","sequence":"first","affiliation":[]},{"given":"Zhe","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yong","family":"Yin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.asoc.2023.110354_b1","doi-asserted-by":"crossref","first-page":"779","DOI":"10.3934\/jimo.2019134","article-title":"Simulated annealing and genetic algorithm based method for a bi-level seru loading problem with worker assignment in seru production systems","volume":"17","author":"Luo","year":"2021","journal-title":"J. Ind. Manag. Optim."},{"issue":"1","key":"10.1016\/j.asoc.2023.110354_b2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.omega.2004.03.004","article-title":"Evaluation of enterprise-level benefits of manufacturing flexibility","volume":"33","author":"Chandra","year":"2005","journal-title":"Omega"},{"issue":"11","key":"10.1016\/j.asoc.2023.110354_b3","doi-asserted-by":"crossref","first-page":"3195","DOI":"10.1080\/00207543.2019.1669841","article-title":"Operational strategies for seru production system: a bi-objective optimisation model and solution methods","volume":"58","author":"Y\u0131lmaz","year":"2020","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"10.1016\/j.asoc.2023.110354_b4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s42524-019-0028-1","article-title":"Review of seru production","volume":"6","author":"Yu","year":"2019","journal-title":"Front. Eng. Manag."},{"issue":"1","key":"10.1016\/j.asoc.2023.110354_b5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.jom.2017.01.003","article-title":"Lessons from seru production on manufacturing competitively in a high cost environment","volume":"49","author":"Yin","year":"2017","journal-title":"J. Oper. Manage."},{"issue":"1\u20132","key":"10.1016\/j.asoc.2023.110354_b6","first-page":"848","article-title":"The evolution of production systems from industry 2.0 through industry 4.0","volume":"56","author":"Yin","year":"2017","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"10.1016\/j.asoc.2023.110354_b7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/itor.12014","article-title":"An implementation framework for seru production","volume":"21","author":"Liu","year":"2014","journal-title":"Int. Trans. Oper. Res."},{"key":"10.1016\/j.asoc.2023.110354_b8","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1016\/j.cie.2018.02.035","article-title":"A multi-skilled worker assignment problem in seru production systems considering the worker heterogeneity","volume":"118","author":"Lian","year":"2018","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"10.1016\/j.asoc.2023.110354_b9","first-page":"29","article-title":"Internationalization of Japanese company and change of production system","volume":"51","author":"S.","year":"1997","journal-title":"Rikkyo Econ. Rev."},{"key":"10.1016\/j.asoc.2023.110354_b10","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/j.omega.2016.01.013","article-title":"Effects of key enabling technologies for seru production on sustainable performance","volume":"66","author":"Zhang","year":"2017","journal-title":"Omega"},{"issue":"2","key":"10.1016\/j.asoc.2023.110354_b11","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1080\/19761597.2010.9668694","article-title":"Seru seisan-an innovation of the production management mode in Japan","volume":"18","author":"Liu","year":"2010","journal-title":"Asian J. Technol. Innov."},{"key":"10.1016\/j.asoc.2023.110354_b12","first-page":"27","article-title":"The evolution of seru production systems throughout canon","volume":"2","author":"Yin","year":"2008","journal-title":"Oper. Manag. Edu. Rev."},{"issue":"1","key":"10.1016\/j.asoc.2023.110354_b13","first-page":"105","article-title":"Seru: the organizational extension of JIT for a super-talent factory","volume":"3","author":"Stecke","year":"2012","journal-title":"Int. J. Strat. Dec. Sci."},{"issue":"1","key":"10.1016\/j.asoc.2023.110354_b14","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1186\/s40064-016-2445-5","article-title":"Complexity of line-seru conversion for different scheduling rules and two improved exact algorithms for the multi-objective optimization","volume":"5","author":"Yu","year":"2016","journal-title":"Springerplus"},{"issue":"8","key":"10.1016\/j.asoc.2023.110354_b15","doi-asserted-by":"crossref","first-page":"2055","DOI":"10.1080\/00207540802275889","article-title":"Modeling and numerical analysis of line-cell conversion problems","volume":"47","author":"Kaku","year":"2009","journal-title":"Int. J. Prod. Res."},{"issue":"18","key":"10.1016\/j.asoc.2023.110354_b16","doi-asserted-by":"crossref","first-page":"5259","DOI":"10.1080\/00207543.2012.693642","article-title":"How to carry out assembly line-cell conversion? A discussion based on factor analysis of system performance improvements","volume":"50","author":"Yu","year":"2012","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.asoc.2023.110354_b17","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1016\/j.ijpe.2013.06.009","article-title":"Reducing worker(s) by converting assembly line into a pure cell system","volume":"145","author":"Yu","year":"2013","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.asoc.2023.110354_b18","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1016\/j.ejor.2014.01.029","article-title":"Mathematical analysis and solutions for multi-objective line-cell conversion problem","volume":"236","author":"Yu","year":"2014","journal-title":"European J. Oper. Res."},{"issue":"5\u20138","key":"10.1016\/j.asoc.2023.110354_b19","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1007\/s00170-013-5027-5","article-title":"Training and assignment of multi-skilled workers for implementing seru production systems","volume":"69","author":"Liu","year":"2013","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"4","key":"10.1016\/j.asoc.2023.110354_b20","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1504\/IJMR.2016.082821","article-title":"A bi-objective combination optimisation model for line-seru conversion based on queuing theory","volume":"11","author":"Shao","year":"2016","journal-title":"Int. J. Manuf. Res."},{"key":"10.1016\/j.asoc.2023.110354_b21","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/s11518-018-5379-3","article-title":"Cost and service-level-based model for a seru production system f ormation problem with uncertain demand","volume":"27","author":"Wang","year":"2018","journal-title":"J. Syst. Sci. Syst. Eng."},{"key":"10.1016\/j.asoc.2023.110354_b22","series-title":"Proceedings of 2016 IEEE International Conference on Industrial Engineering and Engineering Management","first-page":"1055","article-title":"Seru loading with worker-operation assignment in single period","author":"Luo","year":"2016"},{"issue":"2","key":"10.1016\/j.asoc.2023.110354_b23","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1504\/EJIE.2017.083255","article-title":"Modelling and numerical analysis of seru loading problem under uncertainty","volume":"11","author":"Luo","year":"2017","journal-title":"Eur. J. Ind. Eng."},{"key":"10.1016\/j.asoc.2023.110354_b24","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.104917","article-title":"Attaining flexibility in seru production system by means of shojinka: An optimization model and solution approaches","volume":"119","author":"Y\u0131lmaz","year":"2020","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2023.110354_b25","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107354","article-title":"An exact solution method for solving seru scheduling problems with past-sequence-dependent setup time and learning effect","volume":"158","author":"Jiang","year":"2021","journal-title":"Comput. Ind. Eng."},{"issue":"11","key":"10.1016\/j.asoc.2023.110354_b26","doi-asserted-by":"crossref","first-page":"2551","DOI":"10.1080\/01605682.2021.1999182","article-title":"Scheduling controllable processing time jobs in seru production system with resource allocation","volume":"73","author":"Jiang","year":"2021","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/j.asoc.2023.110354_b27","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2021.102581","article-title":"A column generation-based exact solution method for seru scheduling problems","volume":"108","author":"Zhang","year":"2022","journal-title":"Omega"},{"key":"10.1016\/j.asoc.2023.110354_b28","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1016\/j.ejor.2021.06.017","article-title":"Logic-based benders decomposition method for the seru scheduling problem with sequence-dependent setup time and DeJong\u2019s learning effect","volume":"297","author":"Zhang","year":"2022","journal-title":"European J. Oper. Res."},{"issue":"8","key":"10.1016\/j.asoc.2023.110354_b29","doi-asserted-by":"crossref","first-page":"1800","DOI":"10.1080\/01605682.2021.1939172","article-title":"Improved genetic-simulated annealing algorithm for seru loading problem with downward substitution under stochastic environment","volume":"73","author":"Zhang","year":"2022","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/j.asoc.2023.110354_b30","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.asoc.2015.01.028","article-title":"Decision support for unrelated parallel machine scheduling with discrete controllable processing times","volume":"30","author":"Hsieh","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2023.110354_b31","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.asoc.2016.10.039","article-title":"A realistic variant of bi-objective unrelated parallel machine scheduling problem: NSGA-II and MOACO approaches","volume":"50","author":"Afzalirad","year":"2017","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"10.1016\/j.asoc.2023.110354_b32","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1016\/j.ejor.2018.05.056","article-title":"Algorithms for the unrelated parallel machine scheduling problem with a resource constraint","volume":"271","author":"Krzysztof","year":"2018","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.asoc.2023.110354_b33","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.cor.2019.07.016","article-title":"Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem","volume":"111","author":"Vallada","year":"2019","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"10.1016\/j.asoc.2023.110354_b34","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/s10951-021-00714-6","article-title":"Exact and metaheuristic approaches for unrelated parallel machine scheduling","volume":"25","author":"Moser","year":"2022","journal-title":"J. Sched."},{"issue":"6","key":"10.1016\/j.asoc.2023.110354_b35","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1016\/j.cor.2010.09.018","article-title":"A tabu search algorithm for order acceptance and scheduling","volume":"39","author":"Cesaret","year":"2012","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.asoc.2023.110354_b36","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1057\/jors.2012.47","article-title":"Increasing the total net revenue for single machine order acceptance and scheduling problems using an artificial bee colony algorithm","volume":"64","author":"Lin","year":"2013","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/j.asoc.2023.110354_b37","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1016\/j.asoc.2016.09.051","article-title":"Hybrid evolutionary approaches for the single machine order acceptance and scheduling problem","volume":"52","author":"Chaurasia","year":"2017","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"10.1016\/j.asoc.2023.110354_b38","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10951-012-0303-z","article-title":"A survey on offline scheduling with rejection","volume":"16","author":"Shabtay","year":"2012","journal-title":"J. Sched."},{"key":"10.1016\/j.asoc.2023.110354_b39","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1016\/j.asoc.2017.10.015","article-title":"An improved water flow-like algorithm for order acceptance and scheduling with identical parallel machines","volume":"71","author":"Wu","year":"2018","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2023.110354_b40","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.asoc.2015.04.027","article-title":"A hybrid genetic and linear programming algorithm for two-agent order acceptance and scheduling problem","volume":"33","author":"Reisi-Nafchi","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2023.110354_b41","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.104933","article-title":"Lower and upper bounds for the non-linear generalized assignment problem","author":"D\u2019Ambrosio","year":"2020","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.asoc.2023.110354_b42","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1111\/j.1937-5956.1995.tb00039.x","article-title":"Global job shop scheduling with a genetic algorithm","volume":"4","author":"Herrmann","year":"1995","journal-title":"Prod. Oper. Manage."},{"issue":"2","key":"10.1016\/j.asoc.2023.110354_b43","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1287\/mnsc.1040.0296","article-title":"Customer targeting: A neural network approach guided by genetic algorithms","volume":"51","author":"Kim","year":"2005","journal-title":"Manage. Sci."},{"issue":"3","key":"10.1016\/j.asoc.2023.110354_b44","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.1120.1048","article-title":"A hybrid genetic algorithm for multidepot and periodic vehicle routing problems","volume":"60","author":"Vidal","year":"2012","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.asoc.2023.110354_b45","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1080\/00207543.2014.942010","article-title":"Applying genetic algorithm to a new location and routing model of hazardous materials","volume":"53","author":"Ardjmand","year":"2014","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"10.1016\/j.asoc.2023.110354_b46","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/s10489-014-0633-y","article-title":"A genetic algorithm (GA)-based method for the combinatorial optimization in contour formation","volume":"43","author":"Wei","year":"2015","journal-title":"Appl. Intell."},{"key":"10.1016\/j.asoc.2023.110354_b47","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/j.asoc.2017.12.021","article-title":"Two-stage genetic algorithm for parallel machines scheduling problem: cyclic steam stimulation of high viscosity oil reservoirs","volume":"64","author":"Sheremetov","year":"2018","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2023.110354_b48","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.asoc.2017.12.048","article-title":"A novel hybrid genetic algorithm with granular information for feature selection and optimization","volume":"65","author":"Dong","year":"2018","journal-title":"Appl. Soft Comput."},{"issue":"9","key":"10.1016\/j.asoc.2023.110354_b49","doi-asserted-by":"crossref","first-page":"1390","DOI":"10.1080\/01605682.2019.1609891","article-title":"A new hybrid genetic algorithm for the collection scheduling problem for a satellite constellation","volume":"71","author":"Barkaoui","year":"2020","journal-title":"J. Oper. Res. Soc."},{"issue":"9","key":"10.1016\/j.asoc.2023.110354_b50","doi-asserted-by":"crossref","first-page":"2677","DOI":"10.1080\/00207543.2019.1630764","article-title":"Multi-product continuous plant scheduling: combination of decomposition, genetic algorithm, and constructive heuristic","volume":"58","author":"Borisovsky","year":"2020","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.asoc.2023.110354_b51","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2020.106824","article-title":"An adaptive genetic algorithm as a supporting mechanism for microscopy image analysis in a cascade of convolution neural networks","volume":"97","author":"Po\u0142ap","year":"2020","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"10.1016\/j.asoc.2023.110354_b52","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1080\/00207543.2019.1705418","article-title":"Many-objective flow shop scheduling optimisation with genetic algorithm based on fuzzy sets","volume":"59","author":"Xu","year":"2021","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.asoc.2023.110354_b53","series-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"Goldberg","year":"1989"}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494623003721?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494623003721?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T21:57:10Z","timestamp":1762552630000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494623003721"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":53,"alternative-id":["S1568494623003721"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2023.110354","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2023,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A bi-level nested heuristic algorithm for divisional seru order acceptance and scheduling problems","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2023.110354","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"110354"}}