Journal
JOURNAL OF SCHEDULING
Volume 14, Issue 2, Pages 157-171Publisher
SPRINGER
DOI: 10.1007/s10951-009-0143-7
Keywords
Project scheduling; Uncertainty; Stochastic activity durations; Scheduling policies
Ask authors/readers for more resources
We study the resource-constrained project scheduling problem with stochastic activity durations. We introduce a new class of scheduling policies for solving this problem, which make a number of a-priori sequencing decisions in a pre-processing phase while the remaining decisions are made dynamically during project execution. The pre-processing decisions entail the addition of extra precedence constraints to the scheduling instance, hereby resolving some potential resource conflicts. We obtain new competitive results for expected-makespan minimization on representative datasets, which are significantly better than those obtained by the existing algorithms when the variability in the activity durations is medium to high.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available