{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T01:24:29Z","timestamp":1780536269235,"version":"3.54.1"},"reference-count":41,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["52188102"],"award-info":[{"award-number":["52188102"]}],"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":["52275489"],"award-info":[{"award-number":["52275489"]}],"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":["U21B2029"],"award-info":[{"award-number":["U21B2029"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Industrial Engineering"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1016\/j.cie.2025.111590","type":"journal-article","created":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T22:52:59Z","timestamp":1760223179000},"page":"111590","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["A matheuristic for assembly operation scheduling problem with flexible workforce configuration"],"prefix":"10.1016","volume":"211","author":[{"given":"Shichen","family":"Tian","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiaxin","family":"Fan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chunjiang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinyu","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-1485-0722","authenticated-orcid":false,"given":"Liang","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.cie.2025.111590_b1","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1504\/IJOR.2023.129157","article-title":"Markov manpower planning models: A review","volume":"46","author":"Amenaghawon","year":"2023","journal-title":"International Journal of Operational Research"},{"key":"10.1016\/j.cie.2025.111590_b2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.jmsy.2019.04.010","article-title":"Implications of realizing mix flexibility in assembly systems for product modularity\u2014A case study","volume":"52","author":"Asadi","year":"2019","journal-title":"Journal of Manufacturing Systems"},{"key":"10.1016\/j.cie.2025.111590_b3","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109436","article-title":"An aircraft final assembly line balancing problem considering resource constraints and parallel task scheduling","volume":"182","author":"Bao","year":"2023","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"10.1016\/j.cie.2025.111590_b4","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1080\/00207543.2019.1600759","article-title":"Ageing workforce management in manufacturing systems: State of the art and future research agenda","volume":"58","author":"Calzavara","year":"2020","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.cie.2025.111590_b5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.jmsy.2018.07.001","article-title":"Resource-constrained assembly line balancing problems with multi-manned workstations","volume":"48","author":"Chen","year":"2018","journal-title":"Journal of Manufacturing Systems"},{"key":"10.1016\/j.cie.2025.111590_b6","article-title":"Constraint programming model for multi-manned assembly line balancing problem","volume":"124","author":"\u00c7il","year":"2020","journal-title":"Computers & Operations Research"},{"issue":"12","key":"10.1016\/j.cie.2025.111590_b7","doi-asserted-by":"crossref","first-page":"3222","DOI":"10.1108\/K-08-2020-0521","article-title":"Mathematical modeling and two efficient branch and bound algorithms for job shop scheduling problem followed by an assembly stage","volume":"50","author":"Daneshamooz","year":"2021","journal-title":"Kybernetes"},{"issue":"16","key":"10.1016\/j.cie.2025.111590_b8","doi-asserted-by":"crossref","first-page":"3623","DOI":"10.1080\/00207540110056135","article-title":"Assembly planning with an ordering genetic algorithm","volume":"39","author":"De Lit","year":"2001","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.cie.2025.111590_b9","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/j.cie.2018.02.010","article-title":"Linear programming assisted (not embedded) genetic algorithm for flexible jobshop scheduling with lot streaming","volume":"117","author":"Defersha","year":"2018","journal-title":"Computers & Industrial Engineering"},{"issue":"19","key":"10.1016\/j.cie.2025.111590_b10","doi-asserted-by":"crossref","first-page":"6565","DOI":"10.1080\/00207543.2022.2135629","article-title":"A matheuristic for flexible job shop scheduling problem with lot-streaming and machine reconfigurations","volume":"61","author":"Fan","year":"2023","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.cie.2025.111590_b11","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.110290","article-title":"Flexible job-shop scheduling problem with variable lot-sizing: An early release policy-based matheuristic","author":"Fan","year":"2024","journal-title":"Computers & Industrial Engineering"},{"issue":"11","key":"10.1016\/j.cie.2025.111590_b12","doi-asserted-by":"crossref","first-page":"7468","DOI":"10.1109\/TII.2021.3051896","article-title":"Flexible worker allocation in aircraft final assembly line using multiobjective evolutionary algorithms","volume":"17","author":"Fang","year":"2021","journal-title":"IEEE Transactions on Industrial Informatics"},{"issue":"2","key":"10.1016\/j.cie.2025.111590_b13","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.ejor.2018.04.033","article-title":"Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures","volume":"273","author":"Framinan","year":"2019","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2025.111590_b14","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.110333","article-title":"A matheuristic-oriented iterated greedy algorithm for multi-mode resource-constrained project scheduling problem under uncertainty","volume":"193","author":"Gao","year":"2024","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.cie.2025.111590_b15","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/j.cie.2019.01.033","article-title":"Two continuous-time assignment-based models for the multi-mode resource-constrained project scheduling problem","volume":"129","author":"Gn\u00e4gi","year":"2019","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.cie.2025.111590_b16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7232\/iems.2019.18.1.001","article-title":"Planning and scheduling of manpower in an annualized hours environment integrating workers willingness and efficiency","volume":"18","author":"Hasan","year":"2019","journal-title":"Industrial Engineering and Management Systems"},{"issue":"22","key":"10.1016\/j.cie.2025.111590_b17","doi-asserted-by":"crossref","first-page":"6721","DOI":"10.1080\/00207543.2020.1823028","article-title":"Workforce reconfiguration strategies in manufacturing systems: A state of the art","volume":"59","author":"Hashemi-Petroodi","year":"2021","journal-title":"International Journal of Production Research"},{"issue":"2","key":"10.1016\/j.cie.2025.111590_b18","doi-asserted-by":"crossref","first-page":"117","DOI":"10.5267\/j.jpm.2019.11.001","article-title":"A survey in the resource-constrained project and multi-project scheduling problems","volume":"5","author":"Issa","year":"2020","journal-title":"Journal of Project Management"},{"issue":"10","key":"10.1016\/j.cie.2025.111590_b19","doi-asserted-by":"crossref","first-page":"2926","DOI":"10.1080\/00207543.2018.1550269","article-title":"Flow shop scheduling problems with assembly operations: A review and new trends","volume":"57","author":"Komaki","year":"2019","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.cie.2025.111590_b20","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","article-title":"An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem","volume":"174","author":"Li","year":"2016","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/j.cie.2025.111590_b21","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1016\/j.jmsy.2022.05.003","article-title":"Multi-objective complex product assembly scheduling problem considering parallel team and worker skills","volume":"63","author":"Liu","year":"2022","journal-title":"Journal of Manufacturing Systems"},{"key":"10.1016\/j.cie.2025.111590_b22","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106347","article-title":"Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem","volume":"142","author":"Meng","year":"2020","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.cie.2025.111590_b23","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105674","article-title":"Balancing and scheduling assembly lines with human-robot collaboration tasks","volume":"140","author":"Nourmohammadi","year":"2022","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2025.111590_b24","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1007\/s00170-009-2175-8","article-title":"Solving manpower scheduling problem in manufacturing using mixed-integer programming with a two-stage heuristic algorithm","volume":"46","author":"Pan","year":"2010","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"10","key":"10.1016\/j.cie.2025.111590_b25","doi-asserted-by":"crossref","first-page":"4805","DOI":"10.1016\/j.eswa.2015.01.057","article-title":"Variable neighborhood search heuristics for a test assembly design problem","volume":"42","author":"Pereira","year":"2015","journal-title":"Expert Systems with Applications"},{"issue":"5","key":"10.1016\/j.cie.2025.111590_b26","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1108\/AA-12-2018-0262","article-title":"A constraint programming approach to type-2 assembly line balancing problem with assignment restrictions","volume":"39","author":"Pinarbasi","year":"2019","journal-title":"Assembly Automation"},{"issue":"1","key":"10.1016\/j.cie.2025.111590_b27","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.sorms.2015.04.001","article-title":"Workforce flexibility in operations management","volume":"20","author":"Qin","year":"2015","journal-title":"Surveys in Operations Research and Management Science"},{"issue":"8","key":"10.1016\/j.cie.2025.111590_b28","doi-asserted-by":"crossref","first-page":"2161","DOI":"10.1007\/s11590-020-01542-x","article-title":"A branch-and-bound embedded genetic algorithm for resource-constrained project scheduling problem with resource transfer time of aircraft moving assembly line","volume":"14","author":"Ren","year":"2020","journal-title":"Optimization Letters"},{"issue":"9","key":"10.1016\/j.cie.2025.111590_b29","doi-asserted-by":"crossref","first-page":"2604","DOI":"10.1080\/00207543.2019.1622052","article-title":"Hybrid algorithm based on improved extended shifting bottleneck procedure and GA for assembly job shop scheduling problem","volume":"58","author":"Shi","year":"2020","journal-title":"International Journal of Production Research"},{"issue":"1","key":"10.1016\/j.cie.2025.111590_b30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2022.05.049","article-title":"A classification and new benchmark instances for the multi-skilled resource-constrained project scheduling problem","volume":"307","author":"Snauwaert","year":"2023","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.cie.2025.111590_b31","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.ejor.2021.08.024","article-title":"A matheuristic for the generalized order acceptance and scheduling problem","volume":"299","author":"Tarhan","year":"2022","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2025.111590_b32","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.jmsy.2018.10.004","article-title":"Production rescheduling review: Opportunities for industrial integration and practical applications","volume":"49","author":"Uhlmann","year":"2018","journal-title":"Journal of Manufacturing Systems"},{"key":"10.1016\/j.cie.2025.111590_b33","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.cor.2018.09.008","article-title":"A heuristic procedure to solve the project staffing problem with discrete time\/resource trade-offs and personnel scheduling constraints","volume":"101","author":"Van Den Eeckhout","year":"2019","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2025.111590_b34","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2021.108371","article-title":"An adaptive artificial bee colony with reinforcement learning for distributed three-stage assembly scheduling with maintenance","volume":"117","author":"Wang","year":"2022","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.cie.2025.111590_b35","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.jmsy.2021.08.003","article-title":"An integrated job shop scheduling and assembly sequence planning approach for discrete manufacturing","volume":"61","author":"Wang","year":"2021","journal-title":"Journal of Manufacturing Systems"},{"key":"10.1016\/j.cie.2025.111590_b36","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108126","article-title":"A cooperative memetic algorithm with feedback for the energy-aware distributed flow-shops with flexible assembly scheduling","volume":"168","author":"Wang","year":"2022","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.cie.2025.111590_b37","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s00291-020-00583-z","article-title":"A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints","volume":"42","author":"Watermeyer","year":"2020","journal-title":"OR Spectrum"},{"key":"10.1016\/j.cie.2025.111590_b38","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101544","article-title":"A DQN-based memetic algorithm for energy-efficient job shop scheduling problem with integrated limited AGVs","volume":"87","author":"Yao","year":"2024","journal-title":"Swarm and Evolutionary Computation"},{"key":"10.1016\/j.cie.2025.111590_b39","article-title":"A novel mathematical model for the flexible job-shop scheduling problem with limited automated guided vehicles","author":"Yao","year":"2024","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"10.1016\/j.cie.2025.111590_b40","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107316","article-title":"Multi-objective multi-mode resource-constrained project scheduling with fuzzy activity durations in prefabricated building construction","volume":"158","author":"Yuan","year":"2021","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"10.1016\/j.cie.2025.111590_b41","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/j.ejor.2019.11.016","article-title":"Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system","volume":"283","author":"Zhang","year":"2020","journal-title":"European Journal of Operational Research"}],"container-title":["Computers & Industrial Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0360835225007363?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0360835225007363?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:11:20Z","timestamp":1765354280000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0360835225007363"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":41,"alternative-id":["S0360835225007363"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.cie.2025.111590","relation":{},"ISSN":["0360-8352"],"issn-type":[{"value":"0360-8352","type":"print"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A matheuristic for assembly operation scheduling problem with flexible workforce configuration","name":"articletitle","label":"Article Title"},{"value":"Computers & Industrial Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.cie.2025.111590","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"111590"}}