Scheduling with unexpected machine breakdowns

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

Volumn 1671, Issue , 1999, Pages 269-280

  Albers, Susanne ^a   Schmidt, Gunter ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION; RANDOM PROCESSES; SCHEDULING;

COMPETITIVE RATIO; IDENTICAL MACHINES; JOB PROCESSING TIME; MACHINE AVAILABILITY; MACHINE BREAKDOWN; ON-LINE ALGORITHMS; ONLINE VERSIONS; OPTIMAL SCHEDULE;

APPROXIMATION ALGORITHMS;

EID: 84958770918     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48413-4_27     Document Type: Conference Paper

References (8)

1. B. Kalyanasundaram and K.P. Pruhs. Fault-tolerant scheduling. In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, pages 115-124, 1994.
2. B. Kalyanasundaram and K.P. Pruhs. Fault-tolerant real-time scheduling. In Proc. 5th Annual European Symposium on Algorithms (ESA), Springer Lecture Notes in Computer Science, 1997.
3. R. McNaughton. Scheduling with deadlines and loss functions. Management Sci­ence, 6:1-12, 1959.
4. E. Sanlaville. Nearly on line scheduling of preemptive independent tasks. Discrete Applied Mathematics, 57:229-241, 1995.
5. E. Sanlaville. Private communication, 1998.
6. G. Schmidt. Scheduling on semi-identical processors. Z. Oper. Res., 28:153-162, 1984.
7. G. Schmidt. Scheduling independent tasks with deadlines on semi-identical proces­sors. J. Oper. Res. Soc., 39:271-277, 1988.
8. D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, 1985.