{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T20:49:18Z","timestamp":1672606158996},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,5,1]],"date-time":"1987-05-01T00:00:00Z","timestamp":546825600000},"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":[[1987,5]]},"DOI":"10.1016\/0020-0190(87)90231-6","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T01:00:31Z","timestamp":1049504431000},"page":"123-125","source":"Crossref","is-referenced-by-count":15,"title":["The complexity of preemptive scheduling given interprocessor communication delays"],"prefix":"10.1016","volume":"25","author":[{"given":"V.J.","family":"Rayward-Smith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(87)90231-6_BIB1","series-title":"Proc. Internat. Communications Conf.","first-page":"209","article-title":"Communication, computation and computer architecture","author":"Agerwala","year":"1977"},{"key":"10.1016\/0020-0190(87)90231-6_BIB2","series-title":"Computer and Job Shop Scheduling Theory","year":"1976"},{"key":"10.1016\/0020-0190(87)90231-6_BIB3","series-title":"Tech. Rept.","article-title":"Scheduling independent tasks with communications","author":"Cornett","year":"1979"},{"key":"10.1016\/0020-0190(87)90231-6_BIB4","series-title":"NATO Advanced Study Institute Series","article-title":"Deterministic and Stochastic Scheduling","author":"Dempster","year":"1981"},{"key":"10.1016\/0020-0190(87)90231-6_BIB5","series-title":"IEEE Real-Time System Symp","first-page":"57","article-title":"Performance analysis of a distributed real time system","author":"Didic","year":"1982"},{"key":"10.1016\/0020-0190(87)90231-6_BIB6","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(87)90231-6_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","article-title":"Scheduling with deadlines and loss functions","volume":"6","author":"McNaughton","year":"1959","journal-title":"Management Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087902316?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087902316?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T05:26:24Z","timestamp":1553405184000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019087902316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,5]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,5]]}},"alternative-id":["0020019087902316"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90231-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,5]]}}}