{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:02:18Z","timestamp":1725483738226},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679011"},{"type":"electronic","value":"9783540446125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44612-5_40","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T09:28:20Z","timestamp":1178357300000},"page":"446-455","source":"Crossref","is-referenced-by-count":3,"title":["Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[]},{"given":"Lorant","family":"Porkolab","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"40_CR1","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0166-5316(94)90058-2","volume":"20","author":"L. Bianco","year":"1994","unstructured":"L. Bianco, J. Blazewicz, P. Dell\u2019Olmo and M. Drozdowski, Scheduling preemptive multiprocessor tasks on dedicated processors, Performance Evaluation 20 (1994), 361\u2013371.","journal-title":"Performance Evaluation"},{"key":"40_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1023\/A:1018994726051","volume":"70","author":"L. Bianco","year":"1997","unstructured":"L. Bianco, J. Blazewicz, P. Dell\u2019Olmo and M. Drozdowski, Preemptive multiprocessor task scheduling with release and time windows, Annals of Operations Research 70 (1997), 43\u201355.","journal-title":"Annals of Operations Research"},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0166-218X(95)00020-R","volume":"65","author":"J. Blazewicz","year":"1996","unstructured":"J. Blazewicz, M. Drozdowski, D. de Werra and J. Weglarz, Deadline scheduling of multiprocessor tasks, Discrete Applied Mathematics 65 (1996), 81\u201395.","journal-title":"Discrete Applied Mathematics"},{"key":"40_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03217-6","volume-title":"Scheduling Computer and Manufacturing Processes","author":"J. Blazewicz","year":"1996","unstructured":"J. Blazewicz, K.H. Ecker, E. Pesch, G. Schmidt and J. Weglarz, Scheduling Computer and Manufacturing Processes, Springer Verlag, Berlin, 1996."},{"key":"40_CR5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0377-2217(96)00123-3","volume":"94","author":"M. Drozdowski","year":"1996","unstructured":"M. Drozdowski, Scheduling multiprocessor tasks-an overview, European Journal on Operations Research, 94 (1996), 215\u2013230.","journal-title":"European Journal on Operations Research"},{"key":"40_CR6","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1006\/jcss.1998.1587","volume":"57","author":"U. Feige","year":"1998","unstructured":"U. Feige and J. Kilian, Zero knowledge and the chromatic number, Journal of Computer and System Sciences, 57 (1998), 187\u2013199.","journal-title":"Journal of Computer and System Sciences"},{"key":"40_CR7","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lovasz and A. Schrijver, The Ellipsoid Method and its consequences in combinatorial optimization, Combinatorica, 1 (1981) 169\u2013197.","journal-title":"Combinatorica"},{"key":"40_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"M. Gr\u00f6tschel, L. Lovasz and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer Verlag, Berlin, 1988."},{"key":"40_CR9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0166-218X(94)90012-4","volume":"55","author":"J.A. Hoogeveen","year":"1994","unstructured":"J.A. Hoogeveen, S.L. van de Velde and B. Veltman, Complexity of scheduling multiprocessor tasks with prespecified processor allocations, Discrete Applied Mathematics 55 (1994), 259\u2013272.","journal-title":"Discrete Applied Mathematics"},{"key":"40_CR10","volume-title":"Ph.D.thesis","author":"A. Kr\u00e4mer","year":"1995","unstructured":"A. Kr\u00e4mer, Scheduling multiprocessor tasks on dedicated processors, Ph.D.thesis, Fachbereich Mathematik-Informatik, Universit\u00e4t Osnabr\u00fcck, Germany, 1995."},{"key":"40_CR11","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1109\/TC.1985.1676647","volume":"34","author":"H. Krawczyk","year":"1985","unstructured":"H. Krawczyk and M. Kubale, An approximation algorithm for diagnostic test scheduling in multicomputer systems, IEEE Transactions on Computers 34 (1985), 869\u2013872.","journal-title":"IEEE Transactions on Computers"},{"key":"40_CR12","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/0377-2217(96)00131-2","volume":"94","author":"M. Kubale","year":"1996","unstructured":"M. Kubale, Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedictated processors, European Journal of Operational Research, 94 (1996), 242\u2013251.","journal-title":"European Journal of Operational Research"},{"key":"40_CR13","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/B978-0-12-566780-7.50020-9","volume-title":"Progress in Combinatorial Optimization","author":"J. Labetoulle","year":"1984","unstructured":"J. Labetoulle, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Preemptive scheduling of uniform machines subject to release dates, in: W.R. Pulleyblank (ed.), Progress in Combinatorial Optimization, Academic Press, New York, 1984, 245\u2013261."},{"key":"40_CR14","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lovasz","year":"1975","unstructured":"L. Lovasz, On the ratio of optimal integral and fractional covers, Discrete Mathematics 13(1975), 383\u2013390.","journal-title":"Discrete Mathematics"},{"key":"40_CR15","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C. Lund","year":"1994","unstructured":"C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Journal of the ACM 41 (1994), 960\u2013981.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44612-5_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,23]],"date-time":"2019-01-23T12:37:52Z","timestamp":1548247072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44612-5_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679011","9783540446125"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44612-5_40","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}