Note: On Semi-Active Timetabling in Resource-Constrained Project Scheduling

Management Science · 1999 · Volume 45 · Issue 3

Abstract

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.

Keywords

project scheduling/resource constraints, semi-active timetabling

Enable JavaScript for citation tools and additional paper interactions.