| Article ID: | iaor20002106 |
| Country: | United States |
| Volume: | 45 |
| Issue: | 3 |
| Start Page Number: | 452 |
| End Page Number: | 454 |
| Publication Date: | Mar 1999 |
| Journal: | Management Science |
| Authors: | Drexl Andreas, Sprecher Arno |
| Keywords: | scheduling, programming: branch and bound |
The purpose of this note is to demonstrate that the branch-and-bound algorithm presented in Demeulemeester and Herroelen does not reduce the enumeration to semi-active schedules.