Lot sizing when done for the short-term heavily interacts with the sequencing decisions for the operations to be performed. Especially for real-world situations where capacities are scarce, demand is dynamic, and precedence relations among the operations have to be taken into account the MRP II...

Over the years numerous branch-and-bound procedures for solving the resource-constrained project scheduling problem have been developed. Enumerating delaying alternatives, extension alternatives, feasible posets, feasible sequences or feasible subsets, they all aim at finding as fast as possible...

This paper addresses methods for formulating and solving a general class of nonpreemptive resource-constrained project scheduling problems in which job durations are discrete functions of committed renewable, nonrenewable and doubly-constrained resources (multi-mode time resource tradeoff). We...