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.
Davenport A. J., Beck J. C., A survey of techniques for scheduling with uncertainty, www.eil.utoronto.ca/profiles/chris/gz/uncertainty.ps , (last visited 21 Augustus 2010)
Herroelen W., Leus R. Project scheduling under uncertainty: Survey and research potentials, European Journal of Operational Research, Vol. 165, 2005, pp. 289–306.
Leus R. , 'Project scheduling under uncertainty: Survey and research potentials ' (2005 ) 165 European Journal of Operational Research : 289 -306 .
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 ) 97 International Journal of Production Economics : 227 -240 .
Szendrői E. A robust hybrid method for the multimode resource-constrained project scheduling problem, Pollack Periodica, Vol. 5, No. 3, 2010, pp. 175–184.
Szendrői E. , 'A robust hybrid method for the multimode resource-constrained project scheduling problem ' (2010 ) 5 Pollack Periodica : 175 -184 .
Láng B. A robust hybrid method for the resource-constrained project scheduling problem with discounted cash flows, Pollack Periodica, Vol. 5, No. 3, 2010, pp. 167–174.
Láng B. , 'A robust hybrid method for the resource-constrained project scheduling problem with discounted cash flows ' (2010 ) 5 Pollack Periodica : 167 -174 .
Alvarez-Valdés R., Tamarit J. M. The project scheduling polyhedron: Dimension, facets and lifting theorems, European Journal of Operational Research, Vol. 96, 1993, pp. 204–220.
Tamarit J. M. , 'The project scheduling polyhedron: Dimension, facets and lifting theorems ' (1993 ) 96 European Journal of Operational Research : 204 -220 .
Golenko-Ginzburg D., Gonik A. Stochastic network project scheduling with nonconsumable limited resources, International Journal of Production Economics, Vol. 48, 1997, pp. 29–37.
Gonik A. , 'Stochastic network project scheduling with nonconsumable limited resources ' (1997 ) 48 International Journal of Production Economics : 29 -37 .