{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T16:48:55Z","timestamp":1772556535846,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1982,12,1]],"date-time":"1982-12-01T00:00:00Z","timestamp":407548800000},"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":["Performance Evaluation"],"published-print":{"date-parts":[[1982,12]]},"DOI":"10.1016\/0166-5316(82)90024-4","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T02:10:42Z","timestamp":1060308642000},"page":"237-250","source":"Crossref","is-referenced-by-count":776,"title":["On the complexity of fixed-priority scheduling of periodic, real-time tasks"],"prefix":"10.1016","volume":"2","author":[{"given":"Joseph Y.-T.","family":"Leung","sequence":"first","affiliation":[]},{"given":"Jennifer","family":"Whitehead","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0166-5316(82)90024-4_BIB1","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1287\/opre.26.1.127","article-title":"On a real-time scheduling problem","volume":"26","author":"Dhall","year":"1978","journal-title":"Oper. Res."},{"key":"10.1016\/0166-5316(82)90024-4_BIB2","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-5316(82)90024-4_BIB3","volume":"Vol. 2","author":"Knuth","year":"1969"},{"key":"10.1016\/0166-5316(82)90024-4_BIB4","series-title":"Computer Architecture and Networks","first-page":"285","article-title":"Some theorems on real time scheduling","author":"Labetoulle","year":"1974"},{"issue":"1","key":"10.1016\/0166-5316(82)90024-4_BIB5","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0020-0190(81)90066-1","article-title":"Scheduling periodically occurring tasks on multiple processors","volume":"12","author":"Lawler","year":"1981","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/0166-5316(82)90024-4_BIB6","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(80)90123-4","article-title":"A note on preemptive scheduling of periodic, real-time tasks","volume":"11","author":"Leung","year":"1980","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/0166-5316(82)90024-4_BIB7","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","article-title":"Scheduling algorithms for multiprogramming in a hard real-time environment","volume":"20","author":"Liu","year":"1973","journal-title":"J. ACM"},{"key":"10.1016\/0166-5316(82)90024-4_BIB8","series-title":"Proc. of the Spring Joint Comput. Conf.","first-page":"925","article-title":"Scheduling of time critical processes","author":"Serlin","year":"1972"}],"container-title":["Performance Evaluation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166531682900244?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166531682900244?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T20:54:05Z","timestamp":1552596845000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166531682900244"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,12]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1982,12]]}},"alternative-id":["0166531682900244"],"URL":"https:\/\/doi.org\/10.1016\/0166-5316(82)90024-4","relation":{},"ISSN":["0166-5316"],"issn-type":[{"value":"0166-5316","type":"print"}],"subject":[],"published":{"date-parts":[[1982,12]]}}}