Premium
Project scheduling with multiple modes: A comparison of exact algorithms
Author(s) -
Hartmann Sönke,
Drexl Andreas
Publication year - 1998
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/(sici)1097-0037(199812)32:4<283::aid-net5>3.0.co;2-i
Subject(s) - computer science , bounding overwatch , algorithm , scheduling (production processes) , branch and bound , extension (predicate logic) , mathematical optimization , mathematics , artificial intelligence , programming language
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. © 1998 John Wiley & Sons, Inc. Networks 32:283–297, 1998