Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/286735 
Year of Publication: 
2021
Citation: 
[Journal:] OR Spectrum [ISSN:] 1436-6304 [Volume:] 44 [Issue:] 2 [Publisher:] Springer [Place:] Berlin, Heidelberg [Year:] 2021 [Pages:] 575-602
Publisher: 
Springer, Berlin, Heidelberg
Abstract: 
The concept of partially renewable resources provides a general modeling framework that can be used for a wide range of different real-life applications. In this paper, we consider a resource-constrained project duration problem with partially renewable resources, where the temporal constraints between the activities are given by minimum and maximum time lags. We present a new branch-and-bound algorithm for this problem, which is based on a stepwise decomposition of the possible resource consumptions by the activities of the project. It is shown that the new approach results in a polynomially bounded depth of the enumeration tree, which is obtained by kind of a binary search. In a comprehensive experimental performance analysis, we compare our exact solution procedure with all branch-and-bound algorithms and state-of-the-art heuristics from the literature on different benchmark sets. The results of the performance study reveal that our branch-and-bound algorithm clearly outperforms all exact solution procedures. Furthermore, it is shown that our new approach dominates the state-of-the-art heuristics on well known benchmark instances.
Subjects: 
Project scheduling
Branch and bound
Resource-constrained project scheduling
Partially renewable resources
Minimum and maximum time lags
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Document Version: 
Published Version

Files in This Item:
File
Size





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