Please use this identifier to cite or link to this item:
Hartmann, Sönke
Sprecher, Arno
Year of Publication: 
Series/Report no.: 
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.
Project scheduling
resource constraints
multiple modes
tight schedules
Document Type: 
Working Paper

Files in This Item:

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.