{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:38:40Z","timestamp":1759847920826},"reference-count":5,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1016\/s0305-0548(03)00018-2","type":"journal-article","created":{"date-parts":[[2003,3,4]],"date-time":"2003-03-04T14:52:27Z","timestamp":1046789547000},"page":"645-655","source":"Crossref","is-referenced-by-count":28,"title":["A note on the SPT heuristic for solving scheduling problems with generalized due dates"],"prefix":"10.1016","volume":"31","author":[{"given":"Gur","family":"Mosheiov","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Oron","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(03)00018-2_BIB1","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1080\/07408178608975351","article-title":"Scheduling problems with generalized due-dates","volume":"18","author":"Hall","year":"1986","journal-title":"IIE Transactions"},{"key":"10.1016\/S0305-0548(03)00018-2_BIB2","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1002\/1520-6750(199008)37:4<587::AID-NAV3220370411>3.0.CO;2-O","article-title":"A note on the generalized due-dates scheduling problems","volume":"37","author":"Sriskandarajah","year":"1990","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0305-0548(03)00018-2_BIB3","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/0377-2217(91)90149-P","article-title":"On the complexity of generalized due-date scheduling problems","volume":"51","author":"Hall","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00018-2_BIB4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0305-0548(03)00018-2_BIB5","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","article-title":"Minimizing total tardiness on one machine is NP-hard","volume":"15","author":"Du","year":"1990","journal-title":"Mathematics of Operations Research"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000182?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000182?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T06:30:15Z","timestamp":1553668215000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803000182"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":5,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["S0305054803000182"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00018-2","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}