The purpose of this note is to demonstrate that the branch-and-bound algorithm presented in Demeulemeester and Herroelen (1992) does not reduce the enumeration to semi-active schedules.

This paper addresses the issue of how to generate problem instances of controlled difficulty. It focuses on precedence- and resource-constrained (project) scheduling problems, but similar ideas may be applied to other network optimization problems. It describes a network construction procedure...

The subject of the book is project scheduling under resource-constraints. Several well-known scheduling problems, like e.g. the job-shop-scheduling and the assembly line balancing problem, are embedded in the mathematical programming formulation used. Exact solution procedures for a broad class...