TU Berlin

FG Kombinatorische Optimierung und Graphenalgorithmen1989

COGA 5-Wheel

Inhalt

zur Navigation

Preprints 1989

The Order-Theoretic Approach to Scheduling: The Deterministic Case
Zitatschlüssel Report-205-1988
Autor Rolf H. Möhring and Franz J. Radermacher
Buchtitel Advances in Project Scheduling, 1989
Seiten 29-66
Jahr 1988
Nummer 205
Herausgeber R. Slowinski and J. Weglarz
Verlag Elseviers Science Publ., Amsterdam
Institution Technische Universität Berlin, Institut für Mathematik
Zusammenfassung The majority of problems arising in scheduling and the analysis and control of project networks can be treated as combinatorial optimization problems on ordered sets. By now, this order-theoretic approach has led to significant new methods and results dealing with the temporal analysis of project networks, time-cost tradeoff problems, scheduling project networks subject to resource constraints and time windows, and stochastic project networks and scheduling problems. This paper gives an introductory overview of some of the main aspects and results of this theory.
Typ der Publikation Preprint
Download Bibtex Eintrag

Navigation

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe