Themen und Quellen

Thema	Bücher	andere Quellen
Klassifikation von Scheduling-Problemen und -Algorithmen Parameter der Jobs / Maschinen Präzedenzrelationen Zielfunktionen einfache NP-Vollständigkeitsresultate	[BEP+96], [Bru01], [Pin95]
1-Prozessor-Scheduling Smith's ratio rule Setup Scheduling Lot Size Scheduling	[BEP+96], [Bru01], [Pin95]
2-Prozessor-Scheduling Alg. von Coffman/Graham, Alg. von Muntz/Coffman, Alg. von Pinedo (Open Shop), Alg. von Johnson (Flow Shop), Alg. von Jackson (Job Shop)	[BEP+96], [Bru01], [Pin95]
Scheduling für mehrere parallele Prozessoren List Scheduling LPT-Algorithmus Alg. von McNaughton	[BEP+96], [Bru01], [Pin95]
Scheduling mit Kommunikationskosten UCT (Unit Communication Times) LogP-Modell		[Ver98]
Shop Scheduling Flow Shop, Permutation Flow Shop Open Shop Job Shop		[Bur03]
Scheduling von Multiprozessor-Tasks Topologie der Netzwerkverbindungen
Stochastische Scheduling-Probleme		[Ste02]
Hyperthread Scheduling
Broadcast Scheduling
Approximationsalgorithmen		[Woe02]
Online-Algorithmen

[Bru01]: Brucker, Peter:
Scheduling Algorithms
(3^rd Edition, Springer-Verlag 2001)
[BEP+96]: J. Blazewicz, K.H. Ecker, E. Pesch, G. Schmidt, J. Weglarz:
Scheduling Computer and Manufacturing Processes
(Springer-Verlag 1996)
[CCLL95]: P. Chrétienne, E.G. Coffman Jr., J.K. Lenstra, Z. Liu:
Scheduling Theory and its Applications
(John Wiley & Sons 1995)
[CL91]: E.G. Coffman Jr., G.S. Lueker
Probabilistic Analysis of Packing and Partitioning Algorithms
(John Wiley & Sons 1991)
[GLLRK79]: R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan:
Optimization and approximation in deterministic sequencing and scheduling: A survey.
(Ann. Discrete Math., 5:287-326, 1979)
[Pin95]: M. Pinedo:
Scheduling: theory, algorithms, and systems
(Prentice-Hall 1995)

[Ver98]: J. Verriet:
Scheduling with communication for multiprocessor computation
Dissertation, Universität Utrecht (Niederlande), Juni 1998

MAPSP: Workshop on Models and Algorithms for Planning and Scheduling Problems
- MAPSP 2003
- MAPSP 2001
MFCS: Mathematical Foundations of Computer Science
- Proceedings 2002, 2001, 2000, 1999, 1998
PATAT: International Conference on the Practice And Theory of Automated Timetabling
- 2004, 2002, 2000, 1997, 1995
PMS: Workshop on Project Management and Scheduling
- 2004, 2002, 1996
STACS: Symposium on Theoretical Aspects of Computer Science
- Proceedings 2003, 2002, 2001, 2000, 1999
STOC: Symposium on Theory of Computing
- Proceedings

[Ste02]: A. Steger:
Stochastic Scheduling
Fall School on Algorithms for Hard Problems (Slides),
Schwarzenberg, Switzerland, Sep. 2002
[Woe02]: G. Woeginger:
Approximation algorithms for scheduling problems
Fall School on Algorithms for Hard Problems (Slides, Tutorial),
Schwarzenberg, Switzerland, Sep. 2002

[Bur03]: Christoph Burkhalter:
Applet und Lernaufgabe zu "Scheduling Algorithmen"
ETH Zürich

Letzte Änderung: Hanjo Täubig am 07.08.2003