{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T14:43:18Z","timestamp":1761921798908,"version":"build-2065373602"},"reference-count":11,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"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":[[1995,3]]},"DOI":"10.1016\/0020-0190(94)00200-i","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:04:31Z","timestamp":1027649071000},"page":"249-254","source":"Crossref","is-referenced-by-count":15,"title":["Optimal priority assignment for aperiodic tasks with firm deadlines in fixed priority pre-emptive systems"],"prefix":"10.1016","volume":"53","author":[{"given":"Robert","family":"Davis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Burns","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00200-I_BIB1","series-title":"Proc. Real-Time Systems Symp.","article-title":"Mechanisms for enhancing the flexibility and utility of hard real-time systems","author":"Davis","year":"1994"},{"key":"10.1016\/0020-0190(94)00200-I_BIB2","series-title":"Proc. Real-Time Systems Symp.","article-title":"Scheduling slack time in fixed priority pre-emptive systems","author":"Davis","year":"1993"},{"article-title":"Scheduling a production line to minimise maximum tardiness","year":"1955","author":"Jackson","key":"10.1016\/0020-0190(94)00200-I_BIB3"},{"issue":"1","key":"10.1016\/0020-0190(94)00200-I_BIB4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0020-0190(94)90043-4","article-title":"An optimal scheduling algorithm for pre-emptable real-time tasks","volume":"50","author":"Kim","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)00200-I_BIB5","series-title":"Proc. Real-Time Systems Symp.","first-page":"110","article-title":"An optimal algorithm for scheduling soft-aperiodic tasks fixed-priority preemptive systems","author":"Lehoczky","year":"1992"},{"issue":"1","key":"10.1016\/0020-0190(94)00200-I_BIB6","doi-asserted-by":"crossref","first-page":"40","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\/0020-0190(94)00200-I_BIB7","series-title":"Proc. Real-Time Systems Symp.","article-title":"On-line scheduling of hard deadline aperiodic tasks in fixed priority systems","author":"Ramos-Thuel","year":"1993"},{"key":"10.1016\/0020-0190(94)00200-I_BIB8","series-title":"Proc. Real-Time Systems Symp.","article-title":"Algorithms for scheduling hard aperiodic tasks fixed-priority systems using Slack Stealing","author":"Ramos-Thuel","year":"1994"},{"issue":"8","key":"10.1016\/0020-0190(94)00200-I_BIB9","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1109\/32.153383","article-title":"Dynamic scheduling of hard real-time tasks and real-time threads","volume":"18","author":"Schwan","year":"1992","journal-title":"IEEE Trans. Software Engineering"},{"key":"10.1016\/0020-0190(94)00200-I_BIB10","series-title":"Proc. 2nd IEEE Symp. on Parallel and Distributed Systems","first-page":"578","article-title":"An optimal algorithm for guaranteeing sporadic tasks in hard real-time systems","author":"Silly","year":"1990"},{"key":"10.1016\/0020-0190(94)00200-I_BIB11","doi-asserted-by":"crossref","unstructured":"T.S. Tia, J.W.S. Liu and M. Shankar, Algorithms and optimality of scheduling aperiodic requests in fixed-priority preemptive systems, in: Real-Time Systems, to appear.","DOI":"10.1007\/BF00357882"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400200I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400200I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T02:58:17Z","timestamp":1555297097000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909400200I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["002001909400200I"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00200-i","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}