{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T13:48:40Z","timestamp":1761486520067},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"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":[[2002,4]]},"DOI":"10.1016\/s0020-0190(01)00251-4","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T13:55:05Z","timestamp":1034603705000},"page":"107-111","source":"Crossref","is-referenced-by-count":29,"title":["Scheduling with job release dates, delivery times and preemption penalties"],"prefix":"10.1016","volume":"82","author":[{"given":"Zhaohui","family":"Liu","sequence":"first","affiliation":[]},{"given":"T.C.Edwin","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00251-4_BIB001","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/moor.17.1.22","article-title":"Jackson's rule for single-machine scheduling: Making a good heuristic better","volume":"17","author":"Hall","year":"1992","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0020-0190(01)00251-4_BIB002","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/nav.3800210113","article-title":"Some simple scheduling algorithms","volume":"21","author":"Horn","year":"1974","journal-title":"Naval Res. Logist. Quarterly"},{"key":"10.1016\/S0020-0190(01)00251-4_BIB003","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1080\/07408179708966341","article-title":"Generalized preemption models for single-machine dynamic scheduling problems","volume":"29","author":"Julien","year":"1997","journal-title":"IIE Trans."},{"key":"10.1016\/S0020-0190(01)00251-4_BIB004","series-title":"Single-machine scheduling to minimize total completion time subject to job release dates and preemption penalties, Working Paper No. 08\/99-00","author":"Liu","year":"1999"},{"key":"10.1016\/S0020-0190(01)00251-4_BIB005","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1287\/opre.28.6.1436","article-title":"Analysis of a heuristic for one machine scheduling with release dates and delivery times","volume":"28","author":"Potts","year":"1980","journal-title":"Oper. Res."},{"key":"10.1016\/S0020-0190(01)00251-4_BIB006","series-title":"Proc. 10th ACM-SIAM Symposium on Discrete Algorithms","first-page":"759","article-title":"Preemptive scheduling with job-dependent setup times","author":"Schuurman","year":"1999"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002514?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002514?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T22:28:04Z","timestamp":1556836084000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002514"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0020019001002514"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00251-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}