Computational & Technology Resources
an online resource for computational,
engineering & technology publications
Civil-Comp Proceedings
ISSN 1759-3433
CCP: 97
PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON SOFT COMPUTING TECHNOLOGY IN CIVIL, STRUCTURAL AND ENVIRONMENTAL ENGINEERING
Edited by: Y. Tsompanakis, B.H.V. Topping
Paper 19

A Hybrid Metaheuristic for the Resource-Constrained Project Scheduling Problem with Fuzzy Activity Durations

S. Danka

University of Pécs, Hungary

Full Bibliographic Reference for this paper
S. Danka, "A Hybrid Metaheuristic for the Resource-Constrained Project Scheduling Problem with Fuzzy Activity Durations", in Y. Tsompanakis, B.H.V. Topping, (Editors), "Proceedings of the Second International Conference on Soft Computing Technology in Civil, Structural and Environmental Engineering", Civil-Comp Press, Stirlingshire, UK, Paper 19, 2011. doi:10.4203/ccp.97.19
Keywords: resource-constrained project scheduling, fuzzy project scheduling, robust scheduling, metaheuristics, hybrid methods.

Summary
This paper presents a hybrid metaheuristic for the resource-constrained project scheduling problem with fuzzy activity durations. The heuristic algorithm produces "robust" resource-feasible schedules which are totally immune against uncertainties in the activity durations. Theoretically the robust schedule searching process is formulated as a mixed integer linear programming problem based on the "forbidden set" concept. The output of the model is an optimal (robust) conflict repairing relation set. The model developed by Csébfalvi [1] is insensitive to the "real meaning" of the input parameters, so the originally probabilistic (density function oriented) approach can be replaced by a possibilistic (membership function oriented) approach without essential modifications. The hybrid algorithm presented is based on the "sounds of silence" harmony search metaheuristic developed by Csébfalvi et al. [2,3]. In order to illustrate the essence and applicability 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 presented firstly by Golenko-Ginzburg and Gonic [4] and discussed by several authors in the literature. To generate the optimal solutions a state-of-the-art MILP solver (CPLEX) was used.

References
1
G. Csébfalvi, "Robust resource-constrained project scheduling with uncertain activity durations", in B.H.V. Topping, J.M. Adam, F.J. Pallarés, R. Bru, M.L. Romero, (Editors), "Proceedings of the Seventh International Conference on Engineering Computational Technology", Civil-Comp Press, Stirlingshire, United Kingdom, paper 94, 2010. doi:10.4203/ccp.94.94
2
G. Csébfalvi, A. Csébfalvi, E. Szendroi, "A harmony search metaheuristic for the resource-constrained project scheduling problem and its multi-mode version", in F.S. Serifoglu, Ü. Bilge, (Editors), "Proceedings of the Eleventh International Workshop on Project Management and Scheduling", Istanbul, Turkey, 56-59, April 28-30, 2008.
3
G. Csébfalvi, O. Eliezer, B. Láng, R. Levi, "A conflict repairing harmony search metaheuristic and its application for bi-objective resource-constrained project scheduling problems", in F.S. Serifoglu, Ü. Bilge, (Editors), "Proceedings of the Eleventh International Workshop on Project Management and Scheduling", Istanbul, Turkey, 60-63, April 28-30, 2008.
4
D. Golenko-Ginzburg, A. Gonik, "Stochastic network project scheduling with non-consumable limited resources", International Journal of Production Economics, 48, 29-37, 1997. doi:10.1016/S0925-5273(96)00019-9

purchase the full-text of this paper (price £20)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £70 +P&P)