{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:54:25Z","timestamp":1774994065346,"version":"3.50.1"},"reference-count":44,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["N2406003"],"award-info":[{"award-number":["N2406003"]}],"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"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72272029,72588101"],"award-info":[{"award-number":["72272029,72588101"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.ejor.2025.12.022","type":"journal-article","created":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T17:21:46Z","timestamp":1765473706000},"page":"822-839","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["A branch-and-price-and-cut algorithm for divisional seru formation and scheduling problem considering section construction"],"prefix":"10.1016","volume":"332","author":[{"given":"Shiming","family":"Chen","sequence":"first","affiliation":[]},{"given":"Chengkuan","family":"Zeng","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1873-2555","authenticated-orcid":false,"given":"Yu","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0745-318X","authenticated-orcid":false,"given":"Jiafu","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Chongjun","family":"Yan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"11","key":"10.1016\/j.ejor.2025.12.022_bib0001","doi-asserted-by":"crossref","first-page":"1737","DOI":"10.1108\/IJOPM-08-2021-0502","article-title":"Operations in the upper echelons: Leading sustainability through stewardship","volume":"41","author":"Bendoly","year":"2021","journal-title":"International Journal of Operations & Production Management"},{"key":"10.1016\/j.ejor.2025.12.022_bib0002","unstructured":"Bertsimas, D., & Tsitsiklis, J.N. (1997). Introduction to linear optimization. Athena Scientific."},{"key":"10.1016\/j.ejor.2025.12.022_bib0003","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejor.2025.02.038","article-title":"Lagrangian relaxation and branch-and-price algorithm for resource assignment problem in divisional seru systems","author":"Chen","year":"2025","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/j.ejor.2025.12.022_bib0004","doi-asserted-by":"crossref","first-page":"1172","DOI":"10.1287\/opre.1060.0323","article-title":"A branch-and-price algorithm for the multilevel generalized assignment problem","volume":"54","author":"Ceselli","year":"2006","journal-title":"Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.022_bib0005","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1287\/trsc.2018.0878","article-title":"Exact branch-price-and-cut algorithms for vehicle routing","volume":"53","author":"Costa","year":"2019","journal-title":"Transportation Science"},{"issue":"5","key":"10.1016\/j.ejor.2025.12.022_bib0006","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1002\/joom.1184","article-title":"Bespoke supply-chain resilience: The gap between theory and practice","volume":"68","author":"Cohen","year":"2022","journal-title":"Journal of Operations Management"},{"key":"10.1016\/j.ejor.2025.12.022_bib0007","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(98)00213-1","article-title":"Stabilized column generation","volume":"194","author":"du Merle","year":"1999","journal-title":"Discrete Mathematics"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.022_bib0008","doi-asserted-by":"crossref","first-page":"1959","DOI":"10.1007\/s10489-022-03579-0","article-title":"A phased intelligent algorithm for dynamic seru production considering seru formation changes","volume":"53","author":"Fu","year":"2023","journal-title":"Applied Intelligence"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.022_bib0009","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jmse.2020.10.002","article-title":"Minimizing makespan of a production batch within concurrent systems: Seru production perspective","volume":"7","author":"Gai","year":"2022","journal-title":"Journal of Management Science and Engineering"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.022_bib49","doi-asserted-by":"crossref","first-page":"958","DOI":"10.1016\/j.ejor.2024.02.029","article-title":"Optimizing location-routing and demand allocation in the household waste collection system using a branch-and-price algorithm","volume":"316","author":"Han","year":"2024","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.022_bib46","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1287\/opre.1070.0449","article-title":"Subset-row inequalities applied to the vehicle-routing problem with time windows","volume":"56","author":"Jepsen","year":"2008","journal-title":"Operations Research"},{"issue":"8","key":"10.1016\/j.ejor.2025.12.022_bib0011","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":"International Journal of Production Research"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.022_bib0012","doi-asserted-by":"crossref","first-page":"1108","DOI":"10.1287\/ijoc.2023.0019","article-title":"A dedicated pricing algorithm to solve a large Family of nurse scheduling problems with branch-and-price","volume":"36","author":"Legrain","year":"2024","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.022_bib0013","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1016\/j.ejor.2023.01.022","article-title":"An on-line seru scheduling algorithm with proactive waiting considering resource conflicts","volume":"309","author":"Li","year":"2023","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.022_bib0014","article-title":"Why and how seru production systems are responsive and efficient in volatile markets","author":"Li","year":"2025","journal-title":"Production and Operations Management"},{"key":"10.1016\/j.ejor.2025.12.022_bib0016","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/j.cor.2022.106048","article-title":"Reducing tardy batches by seru production: Model, exact solution, cooperative coevolution solution, and insights","volume":"160","author":"Li","year":"2023","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.12.022_bib43","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 heterogeneigy","volume":"118","author":"Lian","year":"2018","journal-title":"Computer & Industrial Engineering"},{"issue":"5\u20138","key":"10.1016\/j.ejor.2025.12.022_bib42","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":"International Journal of Advanced Manufacturing Technology"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.022_bib0018","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.jmse.2021.05.004","article-title":"Solving the rotating seru production problem with dynamic multiobjective evolutionary algorithms","volume":"7","author":"Liu","year":"2022","journal-title":"Journal of Management Science and Engineering"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.022_bib47","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1287\/ijoc.2016.0744","article-title":"New Enhancements foe the Exact Solution of the Vehicle Routing Problem with TIme Windows","volume":"29","author":"Pecin","year":"2017","journal-title":"INFORMS Journal on Computing"},{"issue":"6","key":"10.1016\/j.ejor.2025.12.022_bib48","doi-asserted-by":"crossref","first-page":"1673","DOI":"10.1287\/trsc.2019.0900","article-title":"Comparative Analysis of Capacitated Arc Routing Formulations for Designing a New Branch-Cut-and-Price Algorithm","volume":"53","author":"Pecin","year":"2019","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2025.12.022_bib0019","doi-asserted-by":"crossref","DOI":"10.1155\/2019\/4036794","article-title":"Analysis of the effect of the line-seru conversion on the waiting time with batch arrival","author":"Ren","year":"2019","journal-title":"Mathematical Problems in Engineering"},{"issue":"9","key":"10.1016\/j.ejor.2025.12.022_bib0020","doi-asserted-by":"crossref","first-page":"1473","DOI":"10.1111\/poms.12590","article-title":"Knowledge creation and dissemination in operations and supply chain management","volume":"25","author":"Roth","year":"2016","journal-title":"Production and Operations Management"},{"issue":"6","key":"10.1016\/j.ejor.2025.12.022_bib0021","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1287\/opre.45.6.831","article-title":"A branch-and-price algorithm for the generalized assignment problem","volume":"45","author":"Savelsbergh","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2025.12.022_bib0022","doi-asserted-by":"crossref","first-page":"5662","DOI":"10.1109\/ACCESS.2018.2889372","article-title":"A cooperative coevolution algorithm for the seru production with minimizing makespan","volume":"7","author":"Sun","year":"2019","journal-title":"IEEE access : Practical innovations, open solutions"},{"key":"10.1016\/j.ejor.2025.12.022_bib0034","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.asoc.2023.110354","article-title":"A bi-level nested heuristic algorithm for divisional seru order acceptance and scheduling problems","volume":"143","author":"Wang","year":"2023","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.ejor.2025.12.022_bib0035","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.1007\/s10479-024-05983-w","article-title":"Joint decision-making for divisional seru scheduling and worker assignment considering process sequence constraints","volume":"338","author":"Wang","year":"2024","journal-title":"Annals of Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.022_bib45","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 formation problem with uncertain demand","volume":"27","author":"Wang","year":"2018","journal-title":"Journal od Systems Science and Systems Engineering"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.022_bib0036","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1504\/IJADS.2021.112926","article-title":"Multi-order scheduling optimisation considering product operation and worker allocation in divisional Seru","volume":"14","author":"Wang","year":"2021","journal-title":"International Journal of Applied Decision Sciences"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.022_bib0037","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1287\/trsc.2023.1198","article-title":"Branch-price-and-cut-based solution of order batching problems","volume":"57","author":"Wahlen","year":"2023","journal-title":"Transportation Science"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.022_bib0038","first-page":"199","article-title":"A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems","volume":"32","author":"Wei","year":"2019","journal-title":"INFORMS Journal on Computing"},{"issue":"5","key":"10.1016\/j.ejor.2025.12.022_bib44","doi-asserted-by":"crossref","first-page":"1114","DOI":"10.1108\/IMDS-07-2017-0303","article-title":"Cross-trained worker assignment and comparative analysis on throughput of divisional and rotating seru","volume":"118","author":"Wu","year":"2018","journal-title":"Industrial Management & Data Systems"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.022_bib0023","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":"Yilmaz","year":"2020","journal-title":"International Journal of Production Research"},{"issue":"10","key":"10.1016\/j.ejor.2025.12.022_bib0024","doi-asserted-by":"crossref","first-page":"2978","DOI":"10.1080\/00207543.2016.1277594","article-title":"Minimizing total cost for training and assigning multiskilled workers in Seru production systems","volume":"55","author":"Ying","year":"2017","journal-title":"International Journal of Production Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.022_bib0025","first-page":"213","article-title":"Management of overlapped cross-training: With or without a supervisor?","volume":"2","author":"Yin","year":"2016","journal-title":"Asian Journal of Management Science and Applications"},{"key":"10.1016\/j.ejor.2025.12.022_bib0026","first-page":"27","article-title":"The evolution of seru production systems throughout canon","volume":"2","author":"Yin","year":"2008","journal-title":"Operations Management Education Review"},{"issue":"1\u20132","key":"10.1016\/j.ejor.2025.12.022_bib0027","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1080\/00207543.2017.1403664","article-title":"The evolution of production systems from Industry 2.0 through Industry 4.0","volume":"56","author":"Yin","year":"2018","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.ejor.2025.12.022_bib0029","article-title":"Seru production systems","author":"Yin","year":"2025","journal-title":"Encyclopedia in Operations Management"},{"issue":"18","key":"10.1016\/j.ejor.2025.12.022_bib0030","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":"International Journal of Production Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.022_bib0031","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":"International Journal of Production Economics"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.022_bib0032","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 Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.022_bib0039","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 Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.022_bib0040","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.ejor.2025.12.022_bib0041","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.ijpe.2023.109126","article-title":"An effective two phase heuristic for synchronized Seru production scheduling and 3PL transportation problems","volume":"268","author":"Zhang","year":"2024","journal-title":"International Journal of Production Economics"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725009890?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725009890?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:14:20Z","timestamp":1774991660000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221725009890"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["S0377221725009890"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2025.12.022","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A branch-and-price-and-cut algorithm for divisional seru formation and scheduling problem considering section construction","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2025.12.022","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}