{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:05Z","timestamp":1725558965140},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141645"},{"type":"electronic","value":"9783642141652"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14165-2_26","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T13:26:02Z","timestamp":1278336362000},"page":"299-311","source":"Crossref","is-referenced-by-count":19,"title":["Scheduling Periodic Tasks in a Hard Real-Time Environment"],"prefix":"10.1007","author":[{"given":"Friedrich","family":"Eisenbrand","sequence":"first","affiliation":[]},{"given":"Nicolai","family":"H\u00e4hnle","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Niemeier","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9","family":"Verschae","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Wiese","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., Bhatia, R., Naor, J., Schieber, B.: Minimizing service and operation costs of periodic scheduling. Math. Oper. Res.\u00a027(3) (2002)","key":"26_CR1","DOI":"10.1287\/moor.27.3.518.314"},{"unstructured":"Bhatia, R.: Approximation Algorithms for Scheduling Problems. PhD thesis, University of Maryland (1998)","key":"26_CR2"},{"key":"26_CR3","first-page":"3","volume-title":"Selected papers of the 15th International Symposium on Mathematical Foundations of Computer Science","author":"S.K. Baruah","year":"1993","unstructured":"Baruah, S.K., Howell, R.R., Rosier, L.E.: Feasibility problems for recurring tasks on one processor. In: Selected papers of the 15th International Symposium on Mathematical Foundations of Computer Science, pp. 3\u201320. Elsevier, Amsterdam (1993)"},{"unstructured":"Baruah, S., Rousier, L., Tulchinsky, I., Varvel, D.: The complexity of periodic maintenance. In: Proceedings of the International Computer Symposium (1990)","key":"26_CR4"},{"key":"26_CR5","volume-title":"Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications","author":"G.C. Buttazzo","year":"2004","unstructured":"Buttazzo, G.C.: Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications. Springer, Heidelberg (2004)"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-540-68891-4_30","volume-title":"Integer Programming and Combinatorial Optimization","author":"M. Conforti","year":"2008","unstructured":"Conforti, M., Di Summa, M., Wolsey, L.A.: The mixing set with divisible capacities. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol.\u00a05035, pp. 435\u2013449. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Eisenbrand, F., H\u00e4hnle, N., Niemeier, M., Skutella, M., Verschae, J., Wiese, A.: Scheduling periodic tasks in a hard real-time environment. Technical report, EPF Lausanne & TU Berlin (February 2010), http:\/\/disopt.epfl.ch\/webdav\/site\/disopt\/shared\/PM_EHNSVW10_report.pdf","key":"26_CR7","DOI":"10.1007\/978-3-642-14165-2_26"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W. Fernandez Vega de la","year":"1981","unstructured":"de la Fernandez Vega, W., Lueker, G.S.: Bin packing can be solved within 1\u2009+\u2009\u03b5 in linear time. Combinatorica\u00a01, 349\u2013355 (1981)","journal-title":"Combinatorica"},{"key":"26_CR9","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freemann, New York (1979)"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1287\/ijoc.8.4.428","volume":"8","author":"J. Korst","year":"1996","unstructured":"Korst, J., Aarts, E., Lenstra, J.K.: Scheduling periodic tasks. INFORMS Journal on Computing\u00a08, 428\u2013435 (1996)","journal-title":"INFORMS Journal on Computing"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/BFb0035103","volume-title":"PARLE 1991. Parallel Architectures and Languages Europe","author":"J. Korst","year":"1991","unstructured":"Korst, J., Aarts, E., Lenstra, J.K., Wessels, J.: Periodic multiprocessor scheduling. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds.) PARLE 1991. LNCS, vol.\u00a0505, pp. 166\u2013178. Springer, Heidelberg (1991)"},{"doi-asserted-by":"crossref","unstructured":"Karmakar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional binpacking problem. In: Foundations of Computer Science (FOCS), vol. 23, pp. 312\u2013320 (1982)","key":"26_CR12","DOI":"10.1109\/SFCS.1982.61"},{"unstructured":"Leung, J.Y.-T.: Handbook of Scheduling: Algorithms, Models and Performance Analysis. Chapman & Hall\/CRC (2004)","key":"26_CR13"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BF01582013","volume":"33","author":"O. Marcotte","year":"1985","unstructured":"Marcotte, O.: The cutting stock problem and integer rounding. Mathematical Programming\u00a033, 82\u201392 (1985)","journal-title":"Mathematical Programming"},{"key":"26_CR15","volume-title":"An Introduction to the Theory of Numbers","author":"I. Niven","year":"1991","unstructured":"Niven, I., Zuckerman, H.S., Montgomery, H.L.: An Introduction to the Theory of Numbers, 5th edn. Wiley, Chichester (1991)","edition":"5"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1002\/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G","volume":"41","author":"D. Simchi-Levi","year":"1994","unstructured":"Simchi-Levi, D.: New worst-case results for the bin-packing problem. Naval Research Logistics\u00a041, 579\u2013585 (1994)","journal-title":"Naval Research Logistics"},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0020-0190(97)00061-6","volume":"62","author":"W.F.J. Verhaegh","year":"1997","unstructured":"Verhaegh, W.F.J., Aarts, E.H.L.: A polynomial-time algorithm for knapsack with divisible item sizes. Information Processing Letters\u00a062, 217\u2013221 (1997)","journal-title":"Information Processing Letters"},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/0167-6377(83)90044-5","volume":"2","author":"W.D. Wei","year":"1983","unstructured":"Wei, W.D., Liu, C.L.: On a periodic maintenance problem. Operations Research Letters\u00a02, 90\u201393 (1983)","journal-title":"Operations Research Letters"},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10107-007-0140-6","volume":"115","author":"M. Zhao","year":"2008","unstructured":"Zhao, M., de Farias Jr., I.R.: The mixing-MIR set with divisible capacities. Mathematical Programming\u00a0115, 73\u2013103 (2008)","journal-title":"Mathematical Programming"},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D. Zuckerman","year":"2007","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing\u00a03, 103\u2013128 (2007)","journal-title":"Theory of Computing"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14165-2_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:48:17Z","timestamp":1606186097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}