{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T10:39:28Z","timestamp":1768559968413,"version":"3.49.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1990,11,1]],"date-time":"1990-11-01T00:00:00Z","timestamp":657417600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Real-Time Syst"],"published-print":{"date-parts":[[1990,11]]},"DOI":"10.1007\/bf01995675","type":"journal-article","created":{"date-parts":[[2005,8,14]],"date-time":"2005-08-14T04:24:40Z","timestamp":1123993480000},"page":"301-324","source":"Crossref","is-referenced-by-count":398,"title":["Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor"],"prefix":"10.1007","volume":"2","author":[{"given":"Sanjoy K.","family":"Baruah","sequence":"first","affiliation":[]},{"given":"Louis E.","family":"Rosier","sequence":"additional","affiliation":[]},{"given":"Rodney R.","family":"Howell","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01995675_CR1","first-page":"1","volume":"31","author":"J. Blazewicz","year":"1987","unstructured":"Blazewicz, J. 1987. Selected Topics in Scheduling Theory.Annals of Discrete Mathematics, 31: 1\u201360.","journal-title":"Annals of Discrete Mathematics"},{"key":"BF01995675_CR2","doi-asserted-by":"crossref","unstructured":"Baruah, S., Mok, A. and Rosier, L. 1990. Preemptively Scheduling Hard-Real-Time Sporadic Tasks on One Processor. To be presented at the11th Real-Time Systems Symposium, Orlando, Florida, December.","DOI":"10.1109\/REAL.1990.128746"},{"key":"BF01995675_CR3","unstructured":"Baruah, S., Rosier, L., Tulchinsky, I. and Varvel, D. 1990. The Complexity of Periodic Maintenance. To be presented at the International Computer Symposium, Hsinchu, Taiwan. Also, submitted for publication."},{"key":"BF01995675_CR4","unstructured":"Coffman, E., Jr. (ed.).Computer and Job-Shop Scheduling Theory. New York: Wiley."},{"key":"BF01995675_CR5","doi-asserted-by":"crossref","unstructured":"Cook, S. 1971. The Complexity of Theorem-Proving Procedures. InProc. of the 3rd Ann. ACM Symp. on Theory of Computing, pp. 151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"BF01995675_CR6","volume-title":"Flows in Networks","author":"L. Ford","year":"1962","unstructured":"Ford, L. and Fulkerson, D. 1962.Flows in Networks. Princeton, NJ: Princeton University Press."},{"key":"BF01995675_CR7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/nav.3800210113","volume":"21","author":"W. Horn","year":"1974","unstructured":"Horn, W. 1974. Some Simple Scheduling Algorithms.Naval Research Logistics Quarterly, 21: 177\u2013185.","journal-title":"Naval Research Logistics Quarterly"},{"key":"BF01995675_CR8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Comlexity of Computer Computations","author":"R. Karp","year":"1972","unstructured":"Karp, R. 1972. Reducibility Among Combinatorial Problems. In R. Miller and J. Thatcher (eds.),Comlexity of Computer Computations, New York: Plenum Press, pp. 85\u2013103."},{"key":"BF01995675_CR9","volume-title":"The Art of Computer Programming","author":"D. Knuth","year":"1981","unstructured":"Knuth, D. 1981. Seminumerical Algorithms. vol. 2 ofThe Art of Computer Programming. Reading, MA: Addison-Wesley, (2nd ed.).","edition":"2nd ed."},{"key":"BF01995675_CR10","first-page":"285","volume-title":"Computer Architecture and Networks","author":"J. Labetoulle","year":"1974","unstructured":"Labetoulle, J. 1974. Some Theorems on Real-Time Scheduling. In E. Gelenbe and R. Mahl (eds.),Computer Architecture and Networks, Amsterdam: North-Holland, pp. 285\u2013283."},{"key":"BF01995675_CR11","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H. Lenstra","year":"1983","unstructured":"Lenstra, H. 1983. Integer Programming with a Fixed Number of Variables.Mathematics of Operations Research, 8: 538\u2013548.","journal-title":"Mathematics of Operations Research"},{"key":"BF01995675_CR12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01553887","volume":"4","author":"H. Leung","year":"1989","unstructured":"Leung, H. 1989. A New Algorithm for Scheduling Periodic, Real-Time Tasks.Algorithmica, 4: 209\u2013219.","journal-title":"Algorithmica"},{"key":"BF01995675_CR13","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"C. Liu","year":"1973","unstructured":"Liu, C. and Layland, J. 1973. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment.JACM, 20: 46\u201361.","journal-title":"JACM"},{"key":"BF01995675_CR14","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(80)90123-4","volume":"11","author":"J. Leung","year":"1980","unstructured":"Leung, J. and Merrill, M. 1980. A Note on Preemptive Scheduling of Periodic, Real-time Tasks.Information Processing Letters, 11: 115\u2013118.","journal-title":"Information Processing Letters"},{"key":"BF01995675_CR15","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0020-0190(81)90066-1","volume":"12","author":"E. Lawler","year":"1981","unstructured":"Lawler, E. and Martel, C. 1981. Scheduling Periodically Occurring Tasks on Multiple Processors.Information Processing Letters, 12: 9\u201312.","journal-title":"Information Processing Letters"},{"key":"BF01995675_CR16","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0166-5316(82)90024-4","volume":"2","author":"J. Leung","year":"1982","unstructured":"Leung, J. and Whitehead, J. 1982. On the Complexity of Fixed-Priority Scheduling of Periodic, Real-Time Tasks.Performance Evaluation, 2: 237\u2013250.","journal-title":"Performance Evaluation"},{"key":"BF01995675_CR17","unstructured":"Mok, A. 1989. Personal communication."}],"container-title":["Real-Time Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01995675.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01995675\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01995675","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T17:56:40Z","timestamp":1557770200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01995675"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["BF01995675"],"URL":"https:\/\/doi.org\/10.1007\/bf01995675","relation":{},"ISSN":["0922-6443","1573-1383"],"issn-type":[{"value":"0922-6443","type":"print"},{"value":"1573-1383","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}