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...

We consider the resource-constrained project scheduling problem. The purpose of this paper is to direct the focus to a branch-and-bound concept that can, by simple adaptations, operate on a wide range of problem settings. The general approach can, e.g., deal with multimode problems, resource...

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.

We consider a generalization of the classical resource constrained project scheduling problem. We introduce so-called partially renewable resources by assuming for each resource a capacity on subsets of periods. The concept of partially renewable resources is a fundamental tool in order to make,...