Computational & Technology Resources
an online resource for computational,
engineering & technology publications |
|
Civil-Comp Proceedings
ISSN 1759-3433 CCP: 94
PROCEEDINGS OF THE SEVENTH INTERNATIONAL CONFERENCE ON ENGINEERING COMPUTATIONAL TECHNOLOGY Edited by:
Paper 91
A Hybrid Method for the Resource-Constrained Project Scheduling Problem with Hammock Activities and Strip Packing like Resource Constraints O. Eliezer1 and R. Levi2
1Ort Braude Academic College of Engineering, Carmiel, Israel
O. Eliezer, R. Levi, "A Hybrid Method for the Resource-Constrained Project Scheduling Problem with Hammock Activities and Strip Packing like Resource Constraints", in , (Editors), "Proceedings of the Seventh International Conference on Engineering Computational Technology", Civil-Comp Press, Stirlingshire, UK, Paper 91, 2010. doi:10.4203/ccp.94.91
Keywords: hammock activities, resource-constrained project scheduling, heuristic and metaheuristic techniques, harmony search optimization, hybrid methods, strip packing.
Summary
This paper presents a hybrid method for the resource-constrained project scheduling problem with hammock activities and strip packing like resource constraints. Hammock activities 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 proposed model, a resource-constrained project is characterized by its "best" schedule, where best means a makespan minimal resource-constrained schedule with dedicated resource demand servicing for which the total hammock cost is minimal and the resource profiles approach the ideal rectangular shape as much as possible. The algorithm is an improved conflict repairing version of the "Sounds of Silence" harmony search metaheuristic developed by Csébfalvi et al. [1,2,3] and Eliezer and Csébfalvi [4]. In the improved algorithm the harmony search is combined with a resource leveling-assigning procedure based on a mixed integer linear programming (MILP) formulation developed by Csébfalvi and Konstantinidis [3]. To generate the improvements a state-of-the-art callable MILP solver (CPLEX) was used. In order to illustrate the essence and viability of the proposed approach, we present detailed computational results for the first J30 instance with randomly generated hammock members from the popular PSPLIB [5] benchmark set.
References
purchase the full-text of this paper (price £20)
go to the previous paper |
|