| Article ID: | iaor1999623 |
| Country: | Netherlands |
| Volume: | 94 |
| Issue: | 2 |
| Start Page Number: | 377 |
| End Page Number: | 383 |
| Publication Date: | Oct 1996 |
| Journal: | European Journal of Operational Research |
| Authors: | Sprecher Arno, Hartmann Snke |
We consider the multi-mode resource-constrained project scheduling problem. The focus of our analysis is on an algorithm recently proposed by Speranza and Vercellis for finding makespan minimal solutions. The correctness of the algorithm is examined. By counter examples we illustrate that the algorithm does not generally find (existing) optimal solutions.