Journal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 57, Issue 4, Pages 1265-1282Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207543.2018.1504245
Keywords
project scheduling; branch and bound; uncertainty; chance constraints; resource constraints
Ask authors/readers for more resources
The resource-constrained project scheduling problem (RCPSP) has been widely studied during the last few decades. In real-world projects, however, not all information is known in advance and uncertainty is an inevitable part of these projects. The chance-constrained resource-constrained project scheduling problem (CC-RCPSP) has been recently introduced to deal with uncertainty in the RCPSP. In this paper, we propose a branch-and-bound (B&B) algorithm and a mixed integer linear programming (MILP) formulation that solve a sample average approximation of the CC-RCPSP. We introduce two different branching schemes and eight different priority rules for the proposed B&B algorithm. The computational results suggest that the proposed B&B procedure clearly outperforms both a proposed MILP formulation and a branch-and-cut algorithm from the literature.
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