Note: On Semi-Active Timetabling in Resource-Constrained Project Scheduling
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.