Please use this identifier to cite or link to this item:
Hartmann, Sönke
Drexl, Andreas
Year of Publication: 
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel No. 430
This paper is devoted to a comparison of all available branch-and-bound algorithms that can be applied to solve resource-constrained project scheduling problems with multiple execution modes for each activity. After summarizing the two exact algorithms that have been suggested in the literature, we propose an alternative exact approach based on the concepts of mode and extension alternatives to solve this problem. Subsequently, we compare it to the two procedures available in the literature. Therefore, the three algorithms as well as all available bounding criteria and dominance rules are summarized in a unified framework. In addition to a theoretical comparison of the procedures, we present the results of our computational studies in order to determine the most efficient algorithm.
Project Management and Scheduling
Multiple Modes
Branch-and- Bound
Bounding Rules
Computational Results
Document Type: 
Working Paper
Document Version: 
Digitized Version

Files in This Item:

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