{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T07:02:25Z","timestamp":1777359745114,"version":"3.51.4"},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1016\/0167-6377(94)90064-7","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"87-99","source":"Crossref","is-referenced-by-count":53,"title":["One-machine generalized precedence constrained scheduling problems"],"prefix":"10.1016","volume":"16","author":[{"given":"Erick D.","family":"Wikum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donna C.","family":"Llewellyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George L.","family":"Nemhauser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(94)90064-7_BIB1","series-title":"Management Science Research Report # MSRR-589","article-title":"One machine scheduling with delayed precedence constraints","author":"Balas","year":"1992"},{"key":"10.1016\/0167-6377(94)90064-7_BIB2","series-title":"Theory of Scheduling","author":"Conway","year":"1967"},{"key":"10.1016\/0167-6377(94)90064-7_BIB3","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0167-6377(94)90064-7_BIB4","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0167-6377(94)90064-7_BIB5","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.4.4.339","article-title":"Fast approximation algorithms for knapsack problems","volume":"4","author":"Lawler","year":"1979","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0167-6377(94)90064-7_BIB6","article-title":"One-Machine Generalized Precedence Constrained Scheduling","author":"Wikum","year":"1992"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637794900647?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637794900647?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:52:54Z","timestamp":1552902774000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637794900647"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["0167637794900647"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(94)90064-7","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}