Shortening Project Makespan in the Case of Resource Constraints and Activity Durations Uncertainty
2017 ◽
Vol 6
(3)
◽
pp. 26-36
Keyword(s):
Shortening project expected makespan in the case of resource constraints is the most popular problem in project scheduling. But in practice activity durations is not determined. So the problem is to find a policy which could define which activity should be started at decision points to minimize expected project makespan. This problem usually called SRCPSP. In this paper we define key research tasks of such a problem and propose extended activity-based policy XABP. Computational results show us the high efficiency of this policy.
1979 ◽
Vol 3
(3)
◽
pp. 261-268
◽
2008 ◽
Vol 25
(3)
◽
pp. 204-214
◽
Keyword(s):
2008 ◽
Vol 222
(11)
◽
pp. 1517-1527
◽
1976 ◽
Vol 27
(2)
◽
pp. 341-349
◽
Keyword(s):
2000 ◽
Vol 127
(2)
◽
pp. 425-443
◽
Keyword(s):