Technical Report 205-1988

Title

The Order-Theoretic Approach to Scheduling: The Deterministic Case

Authors

Rolf H. Möhring and Franz J. Radermacher

Publication

Elseviers Science Publ., Amsterdam, Advances in Project Scheduling, ed. R. Slowinski and J. Weglarz, 1989, pp. 29-66

Source

The report may be requested from our secretary Gabriele Klink, email: klink@math.tu-berlin.de

Classification

not available

Keywords

not available

Abstract

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.