{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T07:03:40Z","timestamp":1773471820310,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1992,11,1]],"date-time":"1992-11-01T00:00:00Z","timestamp":720576000000},"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":[[1992,11]]},"DOI":"10.1016\/0167-6377(92)90087-j","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T14:40:45Z","timestamp":1056984045000},"page":"293-295","source":"Crossref","is-referenced-by-count":30,"title":["On the complexity of scheduling tasks with discrete starting times"],"prefix":"10.1016","volume":"12","author":[{"given":"J","family":"Mark Keil","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(92)90087-J_BIB1","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","article-title":"On the complexity of timetable and multicommodity flow problems","volume":"5","author":"Even","year":"1976","journal-title":"SIAM J. Computing"},{"key":"10.1016\/0167-6377(92)90087-J_BIB2","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0167-6377(92)90087-J_BIB3","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/0196-6774(82)90030-X","article-title":"Complexity results for scheduling tasks with discrete starting times","volume":"3","author":"Nakajima","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0167-6377(92)90087-J_BIB4","series-title":"Proc. 16th Ann. Conf. on Information Sciences and Systems","first-page":"75","article-title":"On scheduling equal execution time tasks with discrete starting times","author":"Nakajima","year":"1982"},{"key":"10.1016\/0167-6377(92)90087-J_BIB5","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290087J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290087J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T05:51:04Z","timestamp":1552888264000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779290087J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,11]]},"references-count":5,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1992,11]]}},"alternative-id":["016763779290087J"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(92)90087-j","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1992,11]]}}}