Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
7543878 | Operations Research Letters | 2018 | 9 Pages |
Abstract
We study project scheduling so as to maximize the expected net present value when task durations are exponentially distributed. Based on the structural properties of an optimal solution we show that, even if preemption is allowed, it is not necessary to do so. Next to its managerial importance, this result also allows for a new algorithm which improves on the current state of the art with several orders of magnitude, both in CPU time and in memory usage.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ben Hermans, Roel Leus,