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

Arno Sprecher
Arno Sprecher
Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre, Lehrstuhl für Produktion und Logistik, Olshausenstraße 40, 24098 Kiel, Germany
Search for more papers by this author
,
Andreas Drexl
Andreas Drexl
Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre, Lehrstuhl für Produktion und Logistik, Olshausenstraße 40, 24098 Kiel, Germany
Search for more papers by this author

Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre, Lehrstuhl für Produktion und Logistik, Olshausenstraße 40, 24098 Kiel, Germany

Search for more papers by this author

Andreas Drexl

Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre, Lehrstuhl für Produktion und Logistik, Olshausenstraße 40, 24098 Kiel, Germany

Search for more papers by this author

Published Online:1 Mar 1999https://doi.org/10.1287/mnsc.45.3.452

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.

Volume 45, Issue 3

March 1999

Pages 297-454

Article Information

Metrics

Information

Published Online:March 01, 1999

Cite as

Arno Sprecher, Andreas Drexl, (1999) Note: On Semi-Active Timetabling in Resource-Constrained Project Scheduling. Management Science 45(3):452-454.

https://doi.org/10.1287/mnsc.45.3.452

Keywords

PDF download

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

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

Abstract

Volume 45, Issue 3

Article Information

Metrics

Information

Cite as

Keywords

Sign Up for INFORMS Publications Updates and News