{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T22:50:06Z","timestamp":1769813406709,"version":"3.49.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1998,11]]},"DOI":"10.1016\/s0020-0190(98)00153-7","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"153-159","source":"Crossref","is-referenced-by-count":20,"title":["Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs"],"prefix":"10.1016","volume":"68","author":[{"given":"Valery","family":"Gordon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wieslaw","family":"Kubiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00153-7_BIB1","series-title":"Assigning jobs to time frames on a single machine to minimize total tardiness","author":"Agnetis","year":"1994"},{"key":"10.1016\/S0020-0190(98)00153-7_BIB2","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(98)00153-7_BIB3","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 Trans."},{"key":"10.1016\/S0020-0190(98)00153-7_BIB4","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 J. Oper. Res."},{"key":"10.1016\/S0020-0190(98)00153-7_BIB5","series-title":"Logistics of Production and Inventory","first-page":"445","article-title":"Sequencing and scheduling: algorithms and complexity","volume":"Vol. 4","author":"Lawler","year":"1993"},{"key":"10.1016\/S0020-0190(98)00153-7_BIB6","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 Res. Logist."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098001537?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098001537?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:28:41Z","timestamp":1556058521000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098001537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["S0020019098001537"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00153-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,11]]}}}