Volume 45, Issue 3March 1999
Skip Table Of Content Section
article
On Semi-Active Timetabling in Resource-Constrained Project Scheduling
Pages 452–454
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.
