{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T16:31:21Z","timestamp":1777653081097,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T00:00:00Z","timestamp":1761696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T00:00:00Z","timestamp":1761696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100021828","name":"German Academic Exchange Service","doi-asserted-by":"publisher","award":["57507438"],"award-info":[{"award-number":["57507438"]}],"id":[{"id":"10.13039\/100021828","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10288-025-00606-x","type":"journal-article","created":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T05:16:55Z","timestamp":1761715015000},"page":"37-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling a single machine with compressible jobs to minimize maximum lateness"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9013-9334","authenticated-orcid":false,"given":"Nodari","family":"Vakhania","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,29]]},"reference":[{"key":"606_CR1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco"},{"issue":"3","key":"606_CR2","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1080\/05695558008974515","volume":"12","author":"RG Vickson","year":"1980","unstructured":"Vickson RG (1980) Two Single Machine Sequencing Problems Involving Controllable Processing Times. AIIE Transactions 12(3):258\u2013262","journal-title":"AIIE Transactions"},{"key":"606_CR3","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1016\/0005-1098(86)90014-2","volume":"22","author":"A Janiak","year":"1986","unstructured":"Janiak A (1986) Time-Optimal Control in a Single Machine Problem with Resource Constraints. Automatica 22:745\u2013747","journal-title":"Automatica"},{"key":"606_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s00607-001-1441-x","volume":"68","author":"H Hoogeveen","year":"2002","unstructured":"Hoogeveen H, Woeginger GJ (2002) Some Comments on Sequencing with Controllable Processing Times. Computing 68:181\u2013192","journal-title":"Computing"},{"key":"606_CR5","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1016\/0167-6377(91)90071-V","volume":"10","author":"S Zdrzalka","year":"1991","unstructured":"Zdrzalka S (1991) Scheduling Jobs on a Single Machine with Release Dates, Delivery Times, and Controllable Processing Times. Oper Res Lett 10:519\u2013532","journal-title":"Oper Res Lett"},{"key":"606_CR6","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","volume":"155","author":"D Shabtay","year":"2007","unstructured":"Shabtay D, Steiner G (2007) A Survey of Scheduling with Controllable Processing Times. Discret Appl Math 155:1643\u20131666","journal-title":"Discret Appl Math"},{"issue":"2","key":"606_CR7","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1142\/S0129054109006541","volume":"20","author":"N Shakhlevich","year":"2009","unstructured":"Shakhlevich N, Shioura A, Strusevich V (2009) Single Machine Scheduling with Controllable Processing Times by Submodular Optimization. Int J Found Comput Sci 20(2):247\u2013269","journal-title":"Int J Found Comput Sci"},{"issue":"1","key":"606_CR8","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1287\/ijoc.2015.0660","volume":"28","author":"A Shioura","year":"2016","unstructured":"Shioura A, Shakhlevich N, Strusevich V (2016) Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times subject to Release Dates and Deadlines. INFORMS J Comput 28(1):148\u2013161","journal-title":"INFORMS J Comput"},{"key":"606_CR9","doi-asserted-by":"crossref","unstructured":"Yin N, Wang XY (2011) Single-Machine Scheduling with Controllable Processing Times and Learning Effect, International Journal of Advanced Manufacturing Technology, 54, 743 - 748","DOI":"10.1007\/s00170-010-2973-z"},{"key":"606_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.ijpe.2017.12.025","volume":"189","author":"D Shabtay","year":"2018","unstructured":"Shabtay D, Zofi M (2018) Single Machine Scheduling with Controllable Processing Times and an Unavailability Period to Minimize the Makespan. Int J Prod Econ 189:191\u2013200","journal-title":"Int J Prod Econ"},{"key":"606_CR11","doi-asserted-by":"crossref","unstructured":"Kayvanfar V, Komaki MI GM (2013) Single Machine Scheduling with Controllable Processing Times to Minimize Total Tardiness and Earliness. Comput Ind Eng 65(1):166\u2013175","DOI":"10.1016\/j.cie.2011.08.019"},{"key":"606_CR12","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/790\/1\/012093","volume":"790","author":"C Luo","year":"2020","unstructured":"Luo C, Zhang G (2020) Single Machine Scheduling Problem with Controllable Setup and Job Processing Times and Position-Dependent Workloads. IOP Conference Series Materials Science and Engineering 790:012093","journal-title":"IOP Conference Series Materials Science and Engineering"},{"issue":"2\u20133","key":"606_CR13","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0925-5273(96)00041-2","volume":"43","author":"TCE Cheng","year":"1996","unstructured":"Cheng TCE, Oguz C, Qi XD (1996) Due-date Assignment and Single Machine Scheduling with Compressible Processing Times. Int J Prod Econ 43(2\u20133):107\u2013113","journal-title":"Int J Prod Econ"},{"issue":"3","key":"606_CR14","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1081\/SAP-120004116","volume":"20","author":"XD Qi","year":"2002","unstructured":"Qi XD, Yin G, Birge J (2002) Single Machine Scheduling with Randomly Compressible Processing Times. Stoch Anal Appl 20(3):591\u2013613","journal-title":"Stoch Anal Appl"},{"key":"606_CR15","first-page":"90","volume":"3959","author":"Z Cao","year":"2006","unstructured":"Cao Z, Wang Z, Zhang Y, Liu S (2006) On Several Scheduling Problems with Rejection or Discretely Compressible Processing Times, Theory and Applications of Models of Computation. LNCS 3959:90\u201398","journal-title":"LNCS"},{"key":"606_CR16","doi-asserted-by":"publisher","first-page":"926","DOI":"10.4028\/www.scientific.net\/AMM.575.926","volume":"575","author":"SX Zhang","year":"2014","unstructured":"Zhang SX, Zhang YZ (2014) Scheduling with Discretely Compressible Processing Times to Minimize Makespan. Appl Mech Mater 575:926\u2013930","journal-title":"Appl Mech Mater"},{"key":"606_CR17","unstructured":"Peng M, Yang, Xu B-G (2005) An Algorithm for Delays Problems in Single Resource Scheduling with Compressible Processing Times, Chinese Journal of Management Science, 13, No. 4, 44 - 50"},{"issue":"6","key":"606_CR18","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s10951-012-0287-8","volume":"16","author":"H Kellerer","year":"2012","unstructured":"Kellerer H, Rustogi K, Strusevich V (2012) Approximation Schemes for Scheduling on a Single Machine subject to Cumulative Deterioration and Maintenance. J Sched 16(6):675\u2013683","journal-title":"J Sched"},{"key":"606_CR19","doi-asserted-by":"crossref","unstructured":"Miao C, Zhang Y, Wu C. (2012) Scheduling of Deteriorating Jobs with Release Dates to Minimize the Maximum Lateness, Theoretical Computer Science, 462:80\u201387","DOI":"10.1016\/j.tcs.2012.08.022"},{"issue":"4","key":"606_CR20","doi-asserted-by":"publisher","first-page":"1955","DOI":"10.3934\/jimo.2018131","volume":"15","author":"C Miao","year":"2019","unstructured":"Miao C, Zhang Y (2019) Scheduling with Step-Deteriorating Jobs to Minimize the Makespan. Journal of Industrial and Management Optimization 15(4):1955\u20131964","journal-title":"Journal of Industrial and Management Optimization"},{"key":"606_CR21","doi-asserted-by":"crossref","unstructured":"Pei J, Zhou Y, Yan, P, Pardalos PM (2022) A Concise Guide to Scheduling with Learning and Deteriorating Effects, to appear in International Journal of Production Research,","DOI":"10.1080\/00207543.2022.2049911"},{"issue":"11","key":"606_CR22","doi-asserted-by":"publisher","first-page":"1104","DOI":"10.3390\/math7111104","volume":"7","author":"N Vakhania","year":"2019","unstructured":"Vakhania N (2019) Dynamic Restructuring Framework for Scheduling with Release Times and Due-Dates. Mathematics 7(11):1104","journal-title":"Mathematics"},{"key":"606_CR23","unstructured":"Jackson JR (1955) Scheduling a Production Line to Minimize the Maximum Lateness. In Management Science Research Report 43, University of California, Los Angeles, CA, USA,"},{"key":"606_CR24","unstructured":"Schrage L (March 1971) Obtaining Optimal Solutions to Resource Constrained Network Scheduling Problems, Unpublished Manuscript"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-025-00606-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-025-00606-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-025-00606-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:55:42Z","timestamp":1777445742000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-025-00606-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,29]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["606"],"URL":"https:\/\/doi.org\/10.1007\/s10288-025-00606-x","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,29]]},"assertion":[{"value":"2 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}]}}