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.

• 저널Management Science · 45(3) · 452–454
• 토픽Resource-Constrained Project Scheduling · Management Science and Operations Research
• DOI10.1287/mnsc.45.3.452
• 저자Arno Sprecher, Andreas Drexl