PART IV: APPENDIXES

Mathematical Programming: Formulations and Applications

A.1 Linear Programming Formulations
A.2 Integer Programming Formulations
A.3 Disjunctive Programming Formulations

Deterministic and Stochastic Dynamic Programming

B.1 Deterministic Dynamic Programming
B.2 Stochastic Dynamic Programming

Complexity Theory

C.1 Preliminaries
C.2 Polynomial Time Solutions Versus NP-Hardness
C.3 Examples

Complexity Classification of Deterministic Scheduling Problems

Overview of Stochastic Scheduling Problems

Selected Scheduling Systems

REFERENCES

INDEX