Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 338
We consider the multi-mode resource-constrained project scheduling problem. The focus is on an algorithm which is supposed to find a makespan optimal solution. This algorithm has been presented in a recent paper by Speranza and Vercellis. The correctness of the algorithm is examined. Moreover, two counterexamples in which the algorithm does not lead to an existing optimal solution are presented.