{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:42Z","timestamp":1725456762265},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029605","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:33:46Z","timestamp":1133415226000},"page":"173-179","source":"Crossref","is-referenced-by-count":2,"title":["On preemptive scheduling of periodic, real-time tasks on one processor"],"prefix":"10.1007","author":[{"given":"Sanjoy K.","family":"Baruah","sequence":"first","affiliation":[]},{"given":"Rodney R.","family":"Howell","sequence":"additional","affiliation":[]},{"given":"Louis E.","family":"Rosier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"S. Baruah, R. Howell, and L. Rosier. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Technical Report TR-CS-90-5, Kansas State University, Dept. of Computing and Information Sciences, 1990.","DOI":"10.1007\/BF01995675"},{"key":"14_CR2","first-page":"1","volume":"31","author":"J. Blazewicz","year":"1987","unstructured":"J. Blazewicz. Selected topics in scheduling theory. Annals of Discrete Mathematics, 31:1\u201360, 1987.","journal-title":"Annals of Discrete Mathematics"},{"key":"14_CR3","unstructured":"S. Baruah, L. Rosier, I. Tulchinsky, and D. Varvel. The complexity of periodic maintenance. Submitted for publication, 1989."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"S. Cook. The complexity of theorem-proving procedures. In Proc. of the 3rd Ann. ACM Symp. on Theory of Computing, pages 151\u2013158, 1971.","DOI":"10.1145\/800157.805047"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"R. Karp. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations, pages 85\u2013103. Plenum Press, 1972.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"14_CR6","unstructured":"D. Knuth. Seminumerical Algorithms, volume 2 of The Art of Computer Programming. Addison Wesley, second edition, 1981."},{"key":"14_CR7","unstructured":"J. Labetoulle. Some theorems on real time scheduling. In E. Gelenbe and R. Mahl, editors, Computer Architecture and Networks, pages 285\u2013293. North-Holland, 1974."},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01553887","volume":"4","author":"J. Leung","year":"1989","unstructured":"J. Leung. A new algorithm for scheduling periodic, real-time tasks. Algorithmica, 4:209\u2013219, 1989.","journal-title":"Algorithmica"},{"key":"14_CR9","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"C. Liu","year":"1973","unstructured":"C. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. JACM, 20:46\u201361, 1973.","journal-title":"JACM"},{"key":"14_CR10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(80)90123-4","volume":"11","author":"J. Leung","year":"1980","unstructured":"J. Leung and M. Merrill. A note on preemptive scheduling of periodic, real-time tasks. Information Processing Letters, 11:115\u2013118, 1980.","journal-title":"Information Processing Letters"},{"key":"14_CR11","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0020-0190(81)90066-1","volume":"12","author":"E. Lawler","year":"1981","unstructured":"E. Lawler and C. Martel. Scheduling periodically occurring tasks on multiple processors. Information Processing Letters, 12:9\u201312, 1981.","journal-title":"Information Processing Letters"},{"key":"14_CR12","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0166-5316(82)90024-4","volume":"2","author":"J. Leung","year":"1982","unstructured":"J. Leung and J. Whitehead. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation, 2:237\u2013250, 1982.","journal-title":"Performance Evaluation"},{"key":"14_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L. Stockmeyer","year":"1977","unstructured":"L. Stockmeyer. The polynomial-time hierarchy. Theoret. Comp. Sci., 3:1\u201322, 1977.","journal-title":"Theoret. Comp. Sci."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029605","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:15:45Z","timestamp":1586592945000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029605"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0029605","relation":{},"subject":[]}}