{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T12:03:44Z","timestamp":1784894624270,"version":"3.55.0"},"reference-count":47,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"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","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 & Operations Research"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.cor.2026.107596","type":"journal-article","created":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T23:28:40Z","timestamp":1782862120000},"page":"107596","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A mixed integer programming model and dynamic programming-based approach for multi-product production scheduling under deterioration effect"],"prefix":"10.1016","volume":"194","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9195-4376","authenticated-orcid":false,"given":"Shaojun","family":"Lu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yubei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rui","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Binxiao","family":"Yan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinbao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.cor.2026.107596_b0005","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1287\/msom.2020.0916","article-title":"Making the most of your regret: Workers\u2019 relocation decisions in on-demand platforms","volume":"23","author":"Jiang","year":"2021","journal-title":"Manuf. Serv. Oper. Manag."},{"issue":"1\u20132","key":"10.1016\/j.cor.2026.107596_b0010","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":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107596_b0015","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2024.103115","article-title":"Scheduling with a weight-modifying activity to minimize the total weighted completion time","volume":"128","author":"Lin","year":"2024","journal-title":"Omega"},{"issue":"3","key":"10.1016\/j.cor.2026.107596_b0020","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1287\/opre.38.3.495","article-title":"Scheduling deteriorating jobs on a single processor","volume":"38","author":"Browne","year":"1990","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2026.107596_b0025","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.omega.2016.07.006","article-title":"Parallel-machine scheduling of deteriorating jobs with potential machine disruptions","volume":"69","author":"Yin","year":"2017","journal-title":"Omega"},{"key":"10.1016\/j.cor.2026.107596_b0030","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.inffus.2021.09.021","article-title":"Mass customized\/personalized manufacturing in Industry 4.0 and blockchain: research challenges, main problems, and the design of an information architecture","volume":"79","author":"Espinoza P\u00e9rez","year":"2022","journal-title":"Inf. Fusion"},{"key":"10.1016\/j.cor.2026.107596_b0035","doi-asserted-by":"crossref","DOI":"10.1016\/j.ijpe.2021.108349","article-title":"Supply network design for mass personalization in Industry 4.0 era","volume":"244","author":"Katoozian","year":"2022","journal-title":"Int. J. Prod. Econ."},{"issue":"3","key":"10.1016\/j.cor.2026.107596_b0040","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1080\/00207543.2018.1488086","article-title":"The impact of digital technology and Industry 4.0 on the ripple effect and supply chain risk analytics","volume":"57","author":"Ivanov","year":"2018","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107596_b0045","doi-asserted-by":"crossref","DOI":"10.1016\/j.rcim.2019.101837","article-title":"Digital Twin-driven smart manufacturing: connotation, reference model, applications and research issues","volume":"61","author":"Lu","year":"2020","journal-title":"Rob. Comput. Integr. Manuf."},{"key":"10.1016\/j.cor.2026.107596_b0050","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1016\/j.jmsy.2022.11.006","article-title":"A distributed physical architecture and data-based scheduling method for smart factory based on intelligent agents","volume":"65","author":"Gu","year":"2022","journal-title":"J. Manuf. Syst."},{"issue":"3","key":"10.1016\/j.cor.2026.107596_b0055","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","article-title":"A survey of scheduling problems with setup times or costs","volume":"187","author":"Allahverdi","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107596_b0060","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108736","article-title":"Unrelated parallel machines scheduling with dependent setup times in textile industry","volume":"174","author":"Berthier","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107596_b0065","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109621","article-title":"Joint scheduling of parallel machines and AGVs with sequence-dependent setup times in a matrix workshop","volume":"185","author":"Miao","year":"2023","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"10.1016\/j.cor.2026.107596_b0070","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/j.ejor.2022.09.034","article-title":"Energy-aware production scheduling in the flow shop environment under sequence-dependent setup times, group scheduling and renewable energy constraints","volume":"307","author":"Ghorbanzadeh","year":"2023","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107596_b0075","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1016\/j.ejor.2023.11.024","article-title":"Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates","volume":"315","author":"Morais","year":"2024","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107596_b0080","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.120878","article-title":"A multi-objective optimization algorithm for flow shop group scheduling problem with sequence dependent setup time and worker learning","volume":"233","author":"Sekkal","year":"2023","journal-title":"Expert Syst. Appl."},{"issue":"9\u201310","key":"10.1016\/j.cor.2026.107596_b0085","doi-asserted-by":"crossref","first-page":"2490","DOI":"10.1016\/j.apm.2013.10.061","article-title":"Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates","volume":"38","author":"Ebrahimi","year":"2014","journal-title":"App. Math. Model."},{"key":"10.1016\/j.cor.2026.107596_b0090","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.cie.2016.05.020","article-title":"Resource-constrained unrelated parallel machine scheduling problem with sequence dependent setup times, precedence constraints and machine eligibility restrictions","volume":"98","author":"Afzalirad","year":"2016","journal-title":"Comput. Ind. Eng."},{"issue":"7","key":"10.1016\/j.cor.2026.107596_b0095","doi-asserted-by":"crossref","first-page":"2212","DOI":"10.1080\/00207543.2021.1885068","article-title":"Constraint programming approach for multi-resource-constrained unrelated parallel machine scheduling problem with sequence-dependent setup times","volume":"60","author":"Yunusoglu","year":"2021","journal-title":"Int. J. Prod. Res."},{"issue":"B","key":"10.1016\/j.cor.2026.107596_b0100","article-title":"Online reinforcement learning strategies driven artificial bee colony algorithm for bi-objective distributed reentrant flowshops scheduling problem with sequence-dependent setup time","volume":"298","author":"Yao","year":"2026","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107596_b0105","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101777","article-title":"A self-adaptive two-stage iterative greedy algorithm based on job scales for energy-efficient distributed permutation flowshop scheduling with sequence-dependent setup times","volume":"92","author":"Yu","year":"2025","journal-title":"Swarm Evol. Comput."},{"issue":"7","key":"10.1016\/j.cor.2026.107596_b0110","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1057\/palgrave.jors.2600740","article-title":"Scheduling with time dependent processing times: review and extensions","volume":"50","author":"Alidaee","year":"1999","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/j.cor.2026.107596_b0115","article-title":"Time-dependent scheduling","author":"Gawiejnowicz","year":"2008","journal-title":"Springer Science & Business Media"},{"key":"10.1016\/j.cor.2026.107596_b0120","doi-asserted-by":"crossref","first-page":"2285","DOI":"10.1007\/s12190-024-02052-0","article-title":"Supply chain scheduling with deteriorating jobs and delivery times","volume":"70","author":"Mao","year":"2024","journal-title":"J. Appl. Math. Comput."},{"key":"10.1016\/j.cor.2026.107596_b0125","doi-asserted-by":"crossref","first-page":"1217","DOI":"10.1007\/s11590-023-02039-z","article-title":"Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs","volume":"18","author":"Feng","year":"2024","journal-title":"Optim. Lett."},{"key":"10.1016\/j.cor.2026.107596_b0130","first-page":"10","article-title":"Single machine scheduling problems involving job-dependent step-deterioration dates and job rejection","volume":"23","author":"Mor","year":"2023","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2026.107596_b0135","article-title":"Energy-conscious flexible job shop scheduling problem considering transportation time and deterioration effect simultaneously","volume":"35","author":"Jiang","year":"2022","journal-title":"Sustainable Computing: Informatics and Systems"},{"issue":"4","key":"10.1016\/j.cor.2026.107596_b0140","doi-asserted-by":"crossref","first-page":"936","DOI":"10.1016\/j.cie.2011.12.017","article-title":"An efficient hybrid genetic algorithm to solve assembly line balancing problem with sequence-dependent setup times","volume":"62","author":"Yolmeh","year":"2012","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"10.1016\/j.cor.2026.107596_b0145","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0377-2217(93)90245-I","article-title":"Two parallel machine sequencing problems involving controllable job processing times","volume":"70","author":"Alidaee","year":"1993","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107596_b0150","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.ijpe.2014.06.019","article-title":"Scheduling jobs with equal-processing-time on parallel machines with non-identical capacities to minimize makespan","volume":"156","author":"Wang","year":"2014","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.cor.2026.107596_b0155","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.cor.2014.11.016","article-title":"Scheduling a deteriorating maintenance activity and due-window assignment","volume":"57","author":"Mor","year":"2015","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107596_b0160","first-page":"287","article-title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","volume":"Vol. 5","author":"Graham","year":"1979"},{"issue":"3","key":"10.1016\/j.cor.2026.107596_b0165","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1016\/j.ejor.2011.01.011","article-title":"A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times","volume":"211","author":"Vallada","year":"2011","journal-title":"Eur. J. Oper. Res."},{"issue":"18","key":"10.1016\/j.cor.2026.107596_b0170","doi-asserted-by":"crossref","first-page":"5438","DOI":"10.1080\/00207543.2020.1781278","article-title":"Parallel machine scheduling with multiple processing alternatives and sequence-dependent setup times","volume":"59","author":"Kim","year":"2021","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107596_b0175","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.cor.2019.02.012","article-title":"Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families","volume":"106","author":"Li","year":"2019","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107596_b0180","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/j.ijpe.2004.12.025","article-title":"Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem","volume":"100","author":"Jin","year":"2006","journal-title":"Int. J. Prod. Econ."},{"issue":"3","key":"10.1016\/j.cor.2026.107596_b0185","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1016\/S0377-2217(02)00726-9","article-title":"An exact algorithm for the identical parallel machine scheduling problem","volume":"152","author":"Mokotoff","year":"2004","journal-title":"Eur. J. Oper. Res."},{"issue":"9\u201310","key":"10.1016\/j.cor.2026.107596_b0190","doi-asserted-by":"crossref","first-page":"5660","DOI":"10.1016\/j.apm.2016.01.006","article-title":"Parallel machine scheduling with tool loading","volume":"40","author":"\u00d6zpeynirci","year":"2016","journal-title":"App. Math. Model."},{"issue":"19","key":"10.1016\/j.cor.2026.107596_b0195","doi-asserted-by":"crossref","first-page":"7186","DOI":"10.1080\/00207543.2024.2320707","article-title":"Constructing modified variable neighborhood search approaches to solve a nurse scheduling problem","volume":"62","author":"Chen","year":"2024","journal-title":"Int. J. Prod. Res."},{"issue":"7","key":"10.1016\/j.cor.2026.107596_b0200","doi-asserted-by":"crossref","first-page":"2456","DOI":"10.1080\/00207543.2024.2403766","article-title":"Scheduling a two-stage assembly problem with separated setup time to minimise total tardiness","volume":"63","author":"Luo","year":"2024","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107596_b0205","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2025.101864","article-title":"Scheduling two-stage healthcare appointment systems via a knowledge-based biased random-key genetic algorithm","volume":"94","author":"Yang","year":"2025","journal-title":"Swarm Evol. Comput."},{"issue":"11","key":"10.1016\/j.cor.2026.107596_b0210","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107596_b0215","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1016\/j.ejor.2024.07.028","article-title":"Influence of encoding and neighborhood in landscape analysis and tabu search performance for job shop scheduling problem","volume":"319","author":"Tsogbetse","year":"2024","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107596_b0220","article-title":"A diversity enhanced tree-seed algorithm based on double search with genetic and automated learning search strategies for image segmentation","volume":"113143","author":"Meng","year":"2025","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2026.107596_b0225","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2025.127423","article-title":"Particle swarm optimization based on particle perturbation and elite preservation strategies for dynamic optimization problems","volume":"279","author":"Li","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107596_b0230","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105999","article-title":"Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness","volume":"149","author":"Maecker","year":"2023","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107596_b0235","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109811","article-title":"Data-driven robust optimization of dual-channel closed-loop supply chain network design considering uncertain demand and carbon cap-and-trade policy","volume":"187","author":"Gao","year":"2024","journal-title":"Comput. Ind. Eng."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826002145?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826002145?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T11:37:15Z","timestamp":1784893035000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826002145"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":47,"alternative-id":["S0305054826002145"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107596","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A mixed integer programming model and dynamic programming-based approach for multi-product production scheduling under deterioration effect","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107596","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107596"}}