Note: On semi-active timetabling in resource-constrained project scheduling

被引:2
作者
Sprecher, A [1 ]
Drexl, A [1 ]
机构
[1] Univ Kiel, Inst Betreibswirtschaftlehre, Lehrstuhl Prod & Logistik, D-24098 Kiel, Germany
关键词
project scheduling; resource constraints; semi-active timetabling;
D O I
10.1287/mnsc.45.3.452
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:452 / 454
页数:3
相关论文
共 1 条
[1]   A BRANCH-AND-BOUND PROCEDURE FOR THE MULTIPLE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM [J].
DEMEULEMEESTER, E ;
HERROELEN, W .
MANAGEMENT SCIENCE, 1992, 38 (12) :1803-1818