{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:15:03Z","timestamp":1743084903436,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705741"},{"type":"electronic","value":"9783540705758"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70575-8_21","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"246-257","source":"Crossref","is-referenced-by-count":8,"title":["A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation"],"prefix":"10.1007","author":[{"given":"Friedrich","family":"Eisenbrand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Rothvo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","volume-title":"Handbook of Scheduling \u2014 Algorithms, Models, and Performance Analysis, ch. 28","author":"S. Baruah","year":"2004","unstructured":"Baruah, S., Goossens, J.: Scheduling real-time tasks: Algorithms and complexity. In: Leung, J.Y.-T. (ed.) Handbook of Scheduling \u2014 Algorithms, Models, and Performance Analysis, ch. 28. Chapman & Hall\/CRC, Boca Raton (2004)"},{"key":"21_CR2","unstructured":"Davari, S., Dhall, S.K.: On-line algorithms for allocating periodic-time-critical tasks on multiprocessor systems. Informatica (Slovenia)\u00a019(1) (1995)"},{"key":"21_CR3","volume-title":"Handbook of Scheduling \u2014 Algorithms, Models, and Performance Analysis, ch. 32","author":"S.K. Dhall","year":"2004","unstructured":"Dhall, S.K.: Approximation algorithms for scheduling time-critical jobs on multiprocessor systems. In: Leung, J.Y.-T. (ed.) Handbook of Scheduling \u2014 Algorithms, Models, and Performance Analysis, ch. 32, Chapman & Hall\/CRC, Boca Raton (2004)"},{"issue":"4","key":"21_CR4","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W. Fernandez de la Vega","year":"1981","unstructured":"Fernandez de la Vega, W., Lueker, G.S.: Bin packing can be solved within 1\u2009+\u2009\u03b5 in linear time. Combinatorica\u00a01(4), 349\u2013355 (1981)","journal-title":"Combinatorica"},{"key":"21_CR5","first-page":"117","volume-title":"ECRTS 2005: Proceedings of the 17th Euromicro Conference on Real-Time Systems (ECRTS 2005)","author":"N. Fisher","year":"2005","unstructured":"Fisher, N., Baruah, S.: A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines. In: ECRTS 2005: Proceedings of the 17th Euromicro Conference on Real-Time Systems (ECRTS 2005), pp. 117\u2013126. IEEE Computer Society, Los Alamitos (2005)"},{"key":"21_CR6","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, San Francisco (1979)"},{"issue":"3","key":"21_CR7","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1016\/0196-6774(92)90052-E","volume":"13","author":"D.S. Johnson","year":"1992","unstructured":"Johnson, D.S.: The NP-completeness column: an ongoing guide. J. Algorithms\u00a013(3), 502\u2013524 (1992)","journal-title":"J. Algorithms"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1109\/SFCS.1982.61","volume-title":"23rd annual symposium on foundations of computer science (Chicago, Ill., 1982)","author":"N. Karmarkar","year":"1982","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: 23rd annual symposium on foundations of computer science, Chicago, Ill., pp. 312\u2013320. IEEE, New York (1982)"},{"issue":"4","key":"21_CR9","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Mathematics of Operations Research\u00a08(4), 538\u2013548 (1983)","journal-title":"Mathematics of Operations Research"},{"issue":"12","key":"21_CR10","doi-asserted-by":"publisher","first-page":"1429","DOI":"10.1109\/12.477248","volume":"44","author":"J. Liebeherr","year":"1995","unstructured":"Liebeherr, J., Burchard, A., Oh, Y., Son, S.H.: New strategies for assigning real-time tasks to multiprocessor systems. IEEE Trans. Comput.\u00a044(12), 1429\u20131442 (1995)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"C.L. Liu","year":"1973","unstructured":"Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM\u00a020(1), 46\u201361 (1973)","journal-title":"J. ACM"},{"issue":"3","key":"21_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01088806","volume":"9","author":"Y. Oh","year":"1995","unstructured":"Oh, Y., Son, S.H.: Allocating fixed-priority periodic tasks on multiprocessor systems. Real-Time Syst.\u00a09(3), 207\u2013239 (1995)","journal-title":"Real-Time Syst."},{"key":"21_CR13","unstructured":"Schuurman, P., Woeginger, G.: Approximation schemes \u2013 a tutorial. In: M\u00f6hring, R.H., Potts, C.N., Schulz, A.S., Woeginger, G.J., Wolsey, L.A. (eds.) Lectures on Scheduling (to appear, 2007)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70575-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:25:39Z","timestamp":1714620339000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-70575-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705741","9783540705758"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70575-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}