The Resource-Constrained Project Scheduling Problem
Résumé
This chapter describes the Resource-constrained project scheduling problem as a combinatorial optimization problem. Different combinatorial models of the resource constraints and characterizations of dominant schedule sets are given. In particular, the properties of the order-based representation are studied.