This paper presents a new scheduling model for resource constrained projects with uncertain activity durations. The model produces ‘robust’ resource feasible schedules, which are totally immune against uncertainties in the activity durations. In the presented approach, it is assumed that activity durations are fuzzy variables with triangular membership functions. Theoretically the robust schedule searching process is formulated as a mixed integer linear programming problem. The proposed model is based on the so-called ‘forbidden set’ concept. The presented possibilistic (membership function oriented) model is a modification of a probabilistic (density function oriented) model. In order to illustrate the essence of the proposed approach detailed computational results for two problems are presented. The first problem is a small motivating example; the second problem is a larger project instance. To generate the optimal solutions a state-of-the-art MILP solver (CPLEX) was used.
Csébfalvi G. Robust resource constrained project scheduling with uncertain activity durations, International Conference on Computational Structures Technology, Valencia, Spain, 14–17 September 2010, pp. 54–68.
Van de Vonder S., Demeulemeester E., Herroelen W., Leus R. The use of buffers in project management: the trade-off between stability and makespan, International Journal of Production Economics, Vol. 97, 2005, pp. 227–240.
Leus R., 'The use of buffers in project management: the trade-off between stability and makespan' (2005) 97International Journal of Production Economics: 227-240.
Leus R.The use of buffers in project management: the trade-off between stability and makespanInternational Journal of Production Economics200597227240)| false