{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T05:38:00Z","timestamp":1776749880568,"version":"3.51.2"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["52075453"],"award-info":[{"award-number":["52075453"]}],"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":["71931007"],"award-info":[{"award-number":["71931007"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s10951-025-00846-z","type":"journal-article","created":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T18:34:01Z","timestamp":1751394841000},"page":"111-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing the maximum late work for a single-machine scheduling problem with flexible maintenance activities"],"prefix":"10.1007","volume":"29","author":[{"given":"Yao-Wen","family":"Sang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5244-6483","authenticated-orcid":false,"given":"Jun-Qiang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yumei","family":"Huo","sequence":"additional","affiliation":[]},{"given":"Ma\u0142gorzata","family":"Sterna","sequence":"additional","affiliation":[]},{"given":"Jacek","family":"B\u0142a\u017cewicz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,1]]},"reference":[{"key":"846_CR1","doi-asserted-by":"publisher","first-page":"108135","DOI":"10.1016\/j.cie.2022.108135","volume":"168","author":"P Beldar","year":"2022","unstructured":"Beldar, P., Moghtader, M., Giret, A., & Ansaripoor, A. H. (2022). Non-identical parallel machines batch processing problem with release dates, due dates and variable maintenance activity to minimize total tardiness. Computers & Industrial Engineering, 168, 108135. https:\/\/doi.org\/10.1016\/j.cie.2022.108135","journal-title":"Computers & Industrial Engineering"},{"key":"846_CR2","first-page":"415","volume":"3","author":"J Blazewicz","year":"1984","unstructured":"Blazewicz, J. (1984). Scheduling preemptible tasks on parallel processors with information loss. Technique et Science Informatiques, 3, 415\u2013420.","journal-title":"Technique et Science Informatiques"},{"key":"846_CR3","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0020-0190(87)90145-1","volume":"24","author":"J Blazewicz","year":"1987","unstructured":"Blazewicz, J., & Finke, G. (1987). Minimizing mean weighted execution time loss on identical and uniform processors. Information Processing Letters, 24, 259\u2013263. https:\/\/doi.org\/10.1016\/0020-0190(87)90145-1","journal-title":"Information Processing Letters"},{"key":"846_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-218X(03)00339-1","volume":"134","author":"J Blazewicz","year":"2004","unstructured":"Blazewicz, J., Pesch, E., Sterna, M., & Werner, F. (2004). Open shop scheduling problems with late work criteria. Discrete Applied Mathematics, 134, 1\u201324. https:\/\/doi.org\/10.1016\/S0166-218X(03)00339-1","journal-title":"Discrete Applied Mathematics"},{"key":"846_CR5","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/j.ejor.2004.04.011","volume":"165","author":"J Blazewicz","year":"2005","unstructured":"Blazewicz, J., Pesch, E., Sterna, M., & Werner, F. (2005). The two-machine flow-shop problem with weighted late work criterion and common due date. European Journal of Operational Research, 165, 408\u2013415. https:\/\/doi.org\/10.1016\/j.ejor.2004.04.011","journal-title":"European Journal of Operational Research"},{"key":"846_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10951-006-0005-5","volume":"10","author":"J Blazewicz","year":"2007","unstructured":"Blazewicz, J., Pesch, E., Sterna, M., & Werner, F. (2007). A note on the two machine job shop with the weighted late work criterion. Journal of Scheduling, 10, 87\u201395. https:\/\/doi.org\/10.1007\/s10951-006-0005-5","journal-title":"Journal of Scheduling"},{"key":"846_CR7","doi-asserted-by":"publisher","first-page":"106989","DOI":"10.1016\/j.cie.2020.106989","volume":"151","author":"A Branda","year":"2021","unstructured":"Branda, A., Castellano, D., Guizzi, G., & Popolo, V. (2021). Metaheuristics for the flow shop scheduling problem with maintenance activities integrated. Computers & Industrial Engineering, 151, 106989. https:\/\/doi.org\/10.1016\/j.cie.2020.106989","journal-title":"Computers & Industrial Engineering"},{"key":"846_CR8","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.ejor.2007.06.029","volume":"190","author":"JS Chen","year":"2008","unstructured":"Chen, J. S. (2008). Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan. European Journal of Operational Research, 190, 90\u2013102. https:\/\/doi.org\/10.1016\/j.ejor.2007.06.029","journal-title":"European Journal of Operational Research"},{"key":"846_CR9","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1002\/nav.21869","volume":"66","author":"R Chen","year":"2019","unstructured":"Chen, R., Yuan, J., Ng, C. T., & Cheng, T. C. E. (2019). Single-machine scheduling with deadlines to minimize the total weighted late work. Naval Research Logistics, 66, 582\u2013595. https:\/\/doi.org\/10.1002\/nav.21869","journal-title":"Naval Research Logistics"},{"key":"846_CR10","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.omega.2008.01.001","volume":"37","author":"WJ Chen","year":"2009","unstructured":"Chen, W. J. (2009). Minimizing number of tardy jobs on a single machine subject to periodic maintenance. Omega, 37, 591\u2013599. https:\/\/doi.org\/10.1016\/j.omega.2008.01.001","journal-title":"Omega"},{"key":"846_CR11","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.cie.2017.07.016","volume":"111","author":"X Chen","year":"2017","unstructured":"Chen, X., Chau, V., Xie, P., Sterna, M., & Blazewicz, J. (2017). Complexity of late work minimization in flow shop systems and a particle swarm optimization algorithm for learning effect. Computers & Industrial Engineering, 111, 176\u2013182. https:\/\/doi.org\/10.1016\/j.cie.2017.07.016","journal-title":"Computers & Industrial Engineering"},{"key":"846_CR12","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ejor.2019.12.003","volume":"284","author":"X Chen","year":"2020","unstructured":"Chen, X., Liang, Y., Sterna, M., Wang, W., & Blazewicz, J. (2020). Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date. European Journal of Operational Research, 284, 67\u201374. https:\/\/doi.org\/10.1016\/j.ejor.2019.12.003","journal-title":"European Journal of Operational Research"},{"key":"846_CR13","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10951-015-0464-7","volume":"19","author":"X Chen","year":"2016","unstructured":"Chen, X., Sterna, M., Han, X., & Blazewicz, J. (2016). Scheduling on parallel identical machines with late work criterion: Offline and online cases. Journal of Scheduling, 19, 729\u2013736. https:\/\/doi.org\/10.1007\/s10951-015-0464-7","journal-title":"Journal of Scheduling"},{"key":"846_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0020-0190(90)90184-Y","volume":"36","author":"MC Fields","year":"1990","unstructured":"Fields, M. C., & Frederickson, G. N. (1990). A faster algorithm for the maximum weighted tardiness problem. Information Processing Letters, 36, 39\u201344. https:\/\/doi.org\/10.1016\/0020-0190(90)90184-Y","journal-title":"Information Processing Letters"},{"key":"846_CR15","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1080\/00207543.2018.1456693","volume":"57","author":"E Gerstl","year":"2019","unstructured":"Gerstl, E., Mor, B., & Mosheiov, G. (2019). Scheduling on a proportionate flowshop to minimise total late work. International Journal of Production Research, 57, 531\u2013543. https:\/\/doi.org\/10.1080\/00207543.2018.1456693","journal-title":"International Journal of Production Research"},{"key":"846_CR16","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1080\/00207543.2019.1709672","volume":"59","author":"E Gerstl","year":"2021","unstructured":"Gerstl, E., & Mosheiov, G. (2021). The single machine con problem with unavailability period. International Journal of Production Research, 59, 824\u2013838. https:\/\/doi.org\/10.1080\/00207543.2019.1709672","journal-title":"International Journal of Production Research"},{"key":"846_CR17","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287\u2013326. https:\/\/doi.org\/10.1016\/S0167-5060(08)70356-X","journal-title":"Annals of Discrete Mathematics"},{"key":"846_CR18","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.ejor.2020.03.032","volume":"286","author":"P Gy\u00f6rgyi","year":"2020","unstructured":"Gy\u00f6rgyi, P., & Kis, T. (2020). A common approximation framework for early work, late work, and resource leveling problems. European Journal of Operational Research, 286, 129\u2013137. https:\/\/doi.org\/10.1016\/j.ejor.2020.03.032","journal-title":"European Journal of Operational Research"},{"key":"846_CR19","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1287\/ijoc.7.2.232","volume":"7","author":"AMA Hariri","year":"1995","unstructured":"Hariri, A. M. A., Potts, C. N., & Van Wassenhove, L. N. (1995). Single machine scheduling to minimize total weighted late work. ORSA Journal on Computing, 7, 232\u2013242. https:\/\/doi.org\/10.1287\/ijoc.7.2.232","journal-title":"ORSA Journal on Computing"},{"key":"846_CR20","doi-asserted-by":"publisher","first-page":"4086","DOI":"10.1080\/00207543.2019.1641643","volume":"58","author":"J Huang","year":"2020","unstructured":"Huang, J., Wang, L., & Jiang, Z. (2020). A method combining rules with genetic algorithm for minimizing makespan on a batch processing machine with preventive maintenance. International Journal of Production Research, 58, 4086\u20134102. https:\/\/doi.org\/10.1080\/00207543.2019.1641643","journal-title":"International Journal of Production Research"},{"key":"846_CR21","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.ejor.2014.12.012","volume":"243","author":"Y Huo","year":"2015","unstructured":"Huo, Y., & Zhao, H. (2015). Total completion time minimization on multiple machines subject to machine availability and makespan constraints. European Journal of Operational Research, 243, 547\u2013554. https:\/\/doi.org\/10.1016\/j.ejor.2014.12.012","journal-title":"European Journal of Operational Research"},{"key":"846_CR22","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.ejor.2022.10.047","volume":"308","author":"J-E Justkowiak","year":"2023","unstructured":"Justkowiak, J.-E., Kovalev, S., Kovalyov, M. Y., & Pesch, E. (2023). Single machine scheduling with assignable due dates to minimize maximum and total late work. European Journal of Operational Research, 308, 76\u201383. https:\/\/doi.org\/10.1016\/j.ejor.2022.10.047","journal-title":"European Journal of Operational Research"},{"key":"846_CR23","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1007\/s10878-015-9924-4","volume":"32","author":"I Kacem","year":"2016","unstructured":"Kacem, I., Kellerer, H., & Seifaddini, M. (2016). Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval. Journal of Combinatorial Optimization, 32, 970\u2013981. https:\/\/doi.org\/10.1007\/s10878-015-9924-4","journal-title":"Journal of Combinatorial Optimization"},{"key":"846_CR24","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.ejor.2021.07.023","volume":"298","author":"H Kim","year":"2022","unstructured":"Kim, H., & Kim, B.-I. (2022). Optimal sequence for single server scheduling incorporating a rate-modifying activity under job-dependent linear deterioration. European Journal of Operational Research, 298, 439\u2013450. https:\/\/doi.org\/10.1016\/j.ejor.2021.07.023","journal-title":"European Journal of Operational Research"},{"key":"846_CR25","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1023\/A:1015487829051","volume":"8","author":"MY Kovalyov","year":"2002","unstructured":"Kovalyov, M. Y., & Werner, F. (2002). Approximation schemes for scheduling jobs with common due date on parallel machines to minimize total tardiness. Journal of Heuristics, 8, 415\u2013428. https:\/\/doi.org\/10.1023\/A:1015487829051","journal-title":"Journal of Heuristics"},{"key":"846_CR26","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1287\/mnsc.19.5.544","volume":"19","author":"EL Lawler","year":"1973","unstructured":"Lawler, E. L. (1973). Optimal sequencing of a single machine subject to precedence constraints. Management Science, 19, 544\u2013546. https:\/\/doi.org\/10.1287\/mnsc.19.5.544","journal-title":"Management Science"},{"key":"846_CR27","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/bf00121681","volume":"9","author":"CY Lee","year":"1996","unstructured":"Lee, C. Y. (1996). Machine scheduling with an availability constraint. Journal of Global Optimization, 9, 395\u2013416. https:\/\/doi.org\/10.1007\/bf00121681","journal-title":"Journal of Global Optimization"},{"key":"846_CR28","unstructured":"Leung, J.Y.T. (2004). Minimizing total weighted error for imprecise computation tasks and related problems. In Handbook of Scheduling: Algorithms, Models, and Performance Analysis (pp. 34.1\u201316). CRC Press."},{"key":"846_CR29","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.cie.2009.04.014","volume":"58","author":"Y Ma","year":"2010","unstructured":"Ma, Y., Chu, C., & Zuo, C. (2010). A survey of scheduling with deterministic machine availability constraints. Computers & Industrial Engineering, 58, 199\u2013211. https:\/\/doi.org\/10.1016\/j.cie.2009.04.014","journal-title":"Computers & Industrial Engineering"},{"key":"846_CR30","doi-asserted-by":"publisher","first-page":"108168","DOI":"10.1016\/j.cie.2022.108168","volume":"169","author":"B Mor","year":"2022","unstructured":"Mor, B., & Shabtay, D. (2022). Single-machine scheduling with total late work and job rejection. Computers & Industrial Engineering, 169, 108168. https:\/\/doi.org\/10.1016\/j.cie.2022.108168","journal-title":"Computers & Industrial Engineering"},{"key":"846_CR31","doi-asserted-by":"publisher","first-page":"107138","DOI":"10.1016\/j.cie.2021.107138","volume":"154","author":"G Mosheiov","year":"2021","unstructured":"Mosheiov, G., & Oron, D. (2021). A note on scheduling a rate modifying activity to minimize total late work. Computers & Industrial Engineering, 154, 107138. https:\/\/doi.org\/10.1016\/j.cie.2021.107138","journal-title":"Computers & Industrial Engineering"},{"key":"846_CR32","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1016\/j.ejor.2020.12.061","volume":"293","author":"G Mosheiov","year":"2021","unstructured":"Mosheiov, G., Oron, D., & Shabtay, D. (2021). Minimizing total late work on a single machine with generalized due-dates. European Journal of Operational Research, 293, 837\u2013846. https:\/\/doi.org\/10.1016\/j.ejor.2020.12.061","journal-title":"European Journal of Operational Research"},{"key":"846_CR33","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0167-6377(92)90001-J","volume":"11","author":"CN Potts","year":"1992","unstructured":"Potts, C. N., & Van Wassenhove, L. N. (1992). Approximation algorithms for scheduling a single machine to minimize total late work. Operations Research Letters, 11, 261\u2013266. https:\/\/doi.org\/10.1016\/0167-6377(92)90001-J","journal-title":"Operations Research Letters"},{"key":"846_CR34","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1287\/opre.40.3.586","volume":"40","author":"CN Potts","year":"1992","unstructured":"Potts, C. N., & Van Wassenhove, L. N. (1992). Single machine scheduling to minimize total late work. Operations Research, 40, 586\u2013595. https:\/\/doi.org\/10.1287\/opre.40.3.586","journal-title":"Operations Research"},{"key":"846_CR35","doi-asserted-by":"publisher","first-page":"102923","DOI":"10.1016\/j.omega.2023.102923","volume":"121","author":"Y-W Sang","year":"2023","unstructured":"Sang, Y.-W., Wang, J.-Q., Sterna, M., & Blazewicz, J. (2023). Single machine scheduling with due date assignment to minimize the total weighted lead time penalty and late work. Omega, 121, 102923. https:\/\/doi.org\/10.1016\/j.omega.2023.102923","journal-title":"Omega"},{"issue":"2","key":"846_CR36","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1002\/nav.22222","volume":"72","author":"Y-W Sang","year":"2025","unstructured":"Sang, Y.-W., Wang, J.-Q., Sterna, M., & Blazewicz, J. (2025). Single machine scheduling with the total weighted late work and rejection cost. Naval Research Logistics (NRL), 72(2), 260\u2013274. https:\/\/doi.org\/10.1002\/nav.22222","journal-title":"Naval Research Logistics (NRL)"},{"key":"846_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(98)00367-1","volume":"121","author":"G Schmidt","year":"2000","unstructured":"Schmidt, G. (2000). Scheduling with limited machine availability. European Journal of Operational Research, 121, 1\u201315. https:\/\/doi.org\/10.1016\/S0377-2217(98)00367-1","journal-title":"European Journal of Operational Research"},{"key":"846_CR38","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1007\/s10479-022-04806-0","volume":"322","author":"D Shabtay","year":"2023","unstructured":"Shabtay, D. (2023). A new perspective on single-machine scheduling problems with late work related criteria. Annals of Operations Research, 322, 947\u2013966. https:\/\/doi.org\/10.1007\/s10479-022-04806-0","journal-title":"Annals of Operations Research"},{"key":"846_CR39","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.ejor.2022.02.017","volume":"303","author":"D Shabtay","year":"2022","unstructured":"Shabtay, D., Mosheiov, G., & Oron, D. (2022). Single machine scheduling with common assignable due date\/due window to minimize total weighted early and late work. European Journal of Operational Research, 303, 66\u201377. https:\/\/doi.org\/10.1016\/j.ejor.2022.02.017","journal-title":"European Journal of Operational Research"},{"key":"846_CR40","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.omega.2010.06.006","volume":"39","author":"M Sterna","year":"2011","unstructured":"Sterna, M. (2011). A survey of scheduling problems with late work criteria. Omega, 39, 120\u2013129. https:\/\/doi.org\/10.1016\/j.omega.2010.06.006","journal-title":"Omega"},{"key":"846_CR41","doi-asserted-by":"publisher","first-page":"102453","DOI":"10.1016\/j.omega.2021.102453","volume":"104","author":"M Sterna","year":"2021","unstructured":"Sterna, M. (2021). Late and early work scheduling: a survey. Omega, 104, 102453. https:\/\/doi.org\/10.1016\/j.omega.2021.102453","journal-title":"Omega"},{"key":"846_CR42","doi-asserted-by":"publisher","first-page":"3186","DOI":"10.1080\/00207543.2019.1566675","volume":"57","author":"X Sun","year":"2019","unstructured":"Sun, X., & Geng, X.-N. (2019). Single-machine scheduling with deteriorating effects and machine maintenance. International Journal of Production Research, 57, 3186\u20133199. https:\/\/doi.org\/10.1080\/00207543.2019.1566675","journal-title":"International Journal of Production Research"},{"key":"846_CR43","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.cor.2010.09.003","volume":"38","author":"S Yang","year":"2011","unstructured":"Yang, S., Ma, Y., Xu, D., & Yang, J. (2011). Minimizing total completion time on a single machine with a flexible maintenance activity. Computers & Operations Research, 38, 755\u2013770. https:\/\/doi.org\/10.1016\/j.cor.2010.09.003","journal-title":"Computers & Operations Research"},{"key":"846_CR44","doi-asserted-by":"publisher","first-page":"2311","DOI":"10.1080\/00207543.2013.855833","volume":"52","author":"Y Yin","year":"2014","unstructured":"Yin, Y., Wu, W.-H., Cheng, T., & Wu, C.-C. (2014). Due-date assignment and single-machine scheduling with generalised position-dependent deteriorating jobs and deteriorating multi-maintenance activities. International Journal of Production Research, 52, 2311\u20132326. https:\/\/doi.org\/10.1080\/00207543.2013.855833","journal-title":"International Journal of Production Research"},{"key":"846_CR45","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1002\/nav.21684","volume":"63","author":"Y Yin","year":"2016","unstructured":"Yin, Y., Xu, J., Cheng, T. C. E., Wu, C. C., & Wang, D. J. (2016). Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work. Naval Research Logistics, 63, 172\u2013183. https:\/\/doi.org\/10.1002\/nav.21684","journal-title":"Naval Research Logistics"},{"key":"846_CR46","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.ejor.2013.07.032","volume":"232","author":"X Zhong","year":"2014","unstructured":"Zhong, X., Ou, J., & Wang, G. (2014). Order acceptance and scheduling with machine availability constraints. European Journal of Operational Research, 232, 435\u2013441. https:\/\/doi.org\/10.1016\/j.ejor.2013.07.032","journal-title":"European Journal of Operational Research"},{"key":"846_CR47","doi-asserted-by":"publisher","unstructured":"Zhu, H., Li, M., Zhou, Z., & You, Y. (2016). Due-window assignment and scheduling with general position-dependent processing times involving a deteriorating and compressible maintenance activity. International Journal of Production Research, 54, 3475\u20133490. https:\/\/doi.org\/10.1080\/00207543.2015.1067379","DOI":"10.1080\/00207543.2015.1067379"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-025-00846-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-025-00846-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-025-00846-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T04:50:51Z","timestamp":1776747051000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-025-00846-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,1]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["846"],"URL":"https:\/\/doi.org\/10.1007\/s10951-025-00846-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,1]]},"assertion":[{"value":"29 April 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No potential conflict of interest was reported by the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}