APPENDICES
Appendix A. Mathematical Programming: Formulations and Applications
A.1. Linear Programming Formulations
A.2. Integer Programming Formulations
A.3. Disjunctive Programming Formulations
Appendix B. Deterministic and Stochastic Dynamic Programming
B.1. Deterministic Dynamic Programming
B.2. Stochastic Dynamic Programming
Appendix C. Complexity Theory
C.1. Preliminaries
C.2. Polynomial Time Solutions versus NP-Hardness
C.3. Examples
Appendix D. Complexity Classification of Scheduling Problems
D.1. Problems Solvable in Polynomial Time
D.2. Problems Solvable in Pseudo-Polynomial Time
D.3. Strongly NP-Hard problems
Appendix E. Overview of Stochastic Scheduling Problems
E.1. Tractable Stochastic Scheduling Problems
E.2. Comparisons of Stochastic Scheduling Problems to their Deterministic Counterparts
Appendix F. Selected Scheduling Systems
F.1. Generic Systems
F.2. Application-Specific Systems
F.3. Academic Prototypes