{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:55:03Z","timestamp":1781463303509,"version":"3.54.1"},"reference-count":18,"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,5,6]],"date-time":"2026-05-06T00:00:00Z","timestamp":1778025600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.dam.2026.04.045","type":"journal-article","created":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T06:48:50Z","timestamp":1779173330000},"page":"277-293","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Minimizing total weighted late work with step-learning on a single machine"],"prefix":"10.1016","volume":"391","author":[{"given":"Johnson","family":"Phosavanh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2571-6676","authenticated-orcid":false,"given":"Daniel","family":"Oron","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.04.045_b1","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s10951-022-00763-5","article-title":"Single machine scheduling with step-learning","volume":"27","author":"Atsmony","year":"2024","journal-title":"J. Sched."},{"key":"10.1016\/j.dam.2026.04.045_b2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.orl.2005.03.002","article-title":"Scheduling with step-improving processing times","volume":"34","author":"Cheng","year":"2006","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.dam.2026.04.045_b3","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1080\/01605682.2023.2203150","article-title":"On scheduling of step-improving jobs to minimize the total weighted completion time","volume":"75","author":"Cheng","year":"2024","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/j.dam.2026.04.045_b4","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","article-title":"Models and algorithms of time-dependent scheduling","author":"Gawiejnowicz","year":"2020"},{"key":"10.1016\/j.dam.2026.04.045_b5","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1016\/j.ejor.2025.05.024","article-title":"Theory and methodology of time-dependent scheduling: Past, present and future","volume":"329","author":"Gawiejnowicz","year":"2026","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.dam.2026.04.045_b6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discret. Math."},{"key":"10.1016\/j.dam.2026.04.045_b7","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1287\/ijoc.7.2.232","article-title":"Single machine scheduling to minimize total weighted late work","volume":"7","author":"Hariri","year":"1995","journal-title":"ORSA J. Comput."},{"key":"10.1016\/j.dam.2026.04.045_b8","doi-asserted-by":"crossref","first-page":"2396","DOI":"10.1016\/j.cor.2005.09.011","article-title":"A simple linear time algorithm for scheduling with step-improving processing times","volume":"34","author":"Ji","year":"2007","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.dam.2026.04.045_b9","doi-asserted-by":"crossref","first-page":"1127","DOI":"10.1080\/01605682.2021.1886616","article-title":"Scheduling of step-improving jobs with an identical improving rate","volume":"73","author":"Kim","year":"2022","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/j.dam.2026.04.045_b10","doi-asserted-by":"crossref","first-page":"1481","DOI":"10.1057\/jors.2014.91","article-title":"Minimizing total completion time on a single machine with step improving jobs","volume":"66","author":"Kim","year":"2015","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/j.dam.2026.04.045_b11","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/s10951-020-00646-7","article-title":"Single-machine scheduling with multi-agents to minimize total weighted late work","volume":"23","author":"Li","year":"2020","journal-title":"J. Sched."},{"key":"10.1016\/j.dam.2026.04.045_b12","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1016\/0360-8352(95)00006-M","article-title":"Scheduling jobs with step-deterioration; minimizing makespan on a single- and multi-machine","volume":"28","author":"Mosheiov","year":"1995","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.dam.2026.04.045_b13","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107138","article-title":"A note on scheduling a rate modifying activity to minimize total late work","volume":"154","author":"Mosheiov","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.dam.2026.04.045_b14","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1016\/j.ejor.2023.08.002","article-title":"Two-agent single-machine scheduling with a rate-modifying activity","volume":"312","author":"Phosavanh","year":"2024","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.dam.2026.04.045_b15","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1016\/j.ejor.2024.09.042","article-title":"Minimizing the number of late jobs and total late work with step-learning","volume":"321","author":"Phosavanh","year":"2025","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.dam.2026.04.045_b16","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/opre.40.3.586","article-title":"Single machine scheduling to minimize total late work","volume":"40","author":"Potts","year":"1992","journal-title":"Oper. Res."},{"key":"10.1016\/j.dam.2026.04.045_b17","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.omega.2010.06.006","article-title":"A survey of scheduling problems with late work criteria","volume":"39","author":"Sterna","year":"2011","journal-title":"Omega"},{"key":"10.1016\/j.dam.2026.04.045_b18","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2021.102453","article-title":"Late and early work scheduling: A survey","volume":"104","author":"Sterna","year":"2021","journal-title":"Omega"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X2600274X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X2600274X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:07:42Z","timestamp":1781460462000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X2600274X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":18,"alternative-id":["S0166218X2600274X"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.04.045","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Minimizing total weighted late work with step-learning on a single machine","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.04.045","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}