Preemptive scheduling on dedicated processors: Applications of fractional graph coloring

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1893, Issue , 2000, Pages 446-455

  Jansen, Klaus ^a   Porkolab, Lorant ^b  

^a UNIVERSITY OF KIEL   (Germany)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

COMPLEXITY RESULTS; DEDICATED PROCESSORS; MAXIMUM LATENESS; MINIMUM MAKESPAN; MULTIPROCESSOR TASKS; OPTIMAL PREEMPTIVE SCHEDULE; PRE-EMPTIVE SCHEDULING; STRONGLY NP-HARD;

SCHEDULING;

EID: 84959226754     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44612-5_40     Document Type: Conference Paper

References (15)

1. L. Bianco, J. Blazewicz, P. Dell'Olmo and M. Drozdowski, Scheduling preemptive multiprocessor tasks on dedicated processors, Performance Evaluation 20 (1994), 361-371.
2. L. Bianco, J. Blazewicz, P. Dell'Olmo and M. Drozdowski, Preemptive multiprocessor task scheduling with release and time windows, Annals of Operations Research 70 (1997), 43-55.
3. J. Blazewicz, M. Drozdowski, D. de Werra and J. Weglarz, Deadline scheduling of multiprocessor tasks, Discrete Applied Mathematics 65 (1996), 81-95.
4. J. Blazewicz, K.H. Ecker, E. Pesch, G. Schmidt and J. Weglarz, Scheduling Computer and Manufacturing Processes, Springer Verlag, Berlin, 1996.
5. M. Drozdowski, Scheduling multiprocessor tasks - an overview, European Journal on Operations Research, 94 (1996), 215-230.
6. U. Feige and J. Kilian, Zero knowledge and the chromatic number, Journal of Computer and System Sciences, 57 (1998), 187-199.
7. M. Grotschel, L. Lovasz and A. Schrijver, The Ellipsoid Method and its consequences in combinatorial optimization, Combinatorica, 1 (1981) 169-197.
8. M. Grotschel, L. Lovasz and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer Verlag, Berlin, 1988.
9. 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-272.
10. A. Krämer, Scheduling multiprocessor tasks on dedicated processors, Ph.D.thesis, Fachbereich Mathematik - Informatik, Universität Osnabruck, Germany, 1995.
11. H. Krawczyk and M. Kubale, An approximation algorithm for diagnostic test scheduling in multicomputer systems, IEEE Transactions on Computers 34 (1985), 869-872.
12. M. Kubale, Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedictated processors, European Journal of Operational Research, 94 (1996), 242-251.
13. 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-261.
14. L. Lovasz, On the ratio of optimal integral and fractional covers, Discrete Mathematics 13 (1975), 383-390.
15. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Journal of the ACM 41 (1994), 960-981.