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

A Hybrid Method for the Resource-Constrained Project Scheduling Problem with Hammock Activities

O. Eliezer1 and G. Csébfalvi2

1Ort Braude Academic College of Engineering, Carmiel, Israel
2University of Pécs, Hungary

Full Bibliographic Reference for this paper
, "A Hybrid Method for the Resource-Constrained Project Scheduling Problem with Hammock Activities", in B.H.V. Topping, Y. Tsompanakis, (Editors), "Proceedings of the First International Conference on Soft Computing Technology in Civil, Structural and Environmental Engineering", Civil-Comp Press, Stirlingshire, UK, Paper 1, 2009. doi:10.4203/ccp.92.1
Keywords: hammock activity, resource-constrained project scheduling, heuristic and metaheuristic techniques, harmony search optimization, hybrid methods, managing projects, bi-objective models, computational experiment.

Summary
The concept of hammock activities plays a central role in project management. They are used to fill the time span between other "normal" activities since their duration cannot be calculated or estimated at the initial stage of project planning.

In the unconstrained case, Harhalakis [1] proposed the first rigorous algorithm to calculate the hammock durations. Firstly Csébfalvi and Csébfalvi [2] developed an implicit enumeration algorithm with effective pruning rules for the resource-constrained hammock activity duration computation.

The paper presents a new exact mixed integer linear programming (MILP) approach and an efficient hybrid metaheuristic to cope with this problem.

The proposed hybrid method is combination of a harmony search metaheuristic and a local search algorithm based on linear programming (LP). The harmony search (HS) metaheuristic was recently developed by Lee and Geem [3] in an analogy with music improvisation process where music players improvise to obtain better harmony. The applied harmony search algorithm is a conflict repairing version of the "sounds of silence" harmony search metaheuristic developed for the traditional resource-constrained project scheduling problem (RCPSP) by Csébfalvi et al. [2,4].

In order to illustrate the essence and viability of the proposed hybrid method, we present computational results for a J30 subset from the well-known and popular PSPLIB [5].

References
1
G. Harhalakis, "Special Features of precedence network charts", European Journal of Operational Research, 49, 50-59, 1990. doi:10.1016/0377-2217(90)90119-V
2
G. Csébfalvi, A. Csébfalvi, "Hammock Activities in Project Scheduling", in "Proceedings of the Sixteenth Annual Conference of POMS", Chicago, IL, USA, April 29 - May 2, www.poms.org/ConfPapers/003/003-0572.pdf, 2005.
3
K.S. Lee, Z.W. Geem, "A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice", Computer Methods in Applied Mechanics and Engineering, 194, 3902-3933, 2005. doi:10.1016/j.cma.2004.09.007
4
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 "Project Management and Scheduling 2008", F.S. Serifoglu, Ü. Bilge, (Editors), Istanbul, Turkey, 56-59, 2008.
5
R. Kolisch, A. Sprecher, "PSPLIB - a project scheduling library", European Journal of Operational Research, 96, 205-216, 1996. doi:10.1016/S0377-2217(96)00170-1

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

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