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 92
A Hybrid Method for the Resource-Constrained Project Scheduling Problem with Discounted Cash Flows and Strip Packing like Resource Constraints B. Láng
Corvinus University of Budapest, Hungary , "A Hybrid Method for the Resource-Constrained Project Scheduling Problem with Discounted Cash Flows and Strip Packing like Resource Constraints", in , (Editors), "Proceedings of the Seventh International Conference on Engineering Computational Technology", Civil-Comp Press, Stirlingshire, UK, Paper 92, 2010. doi:10.4203/ccp.94.92
Keywords: resource-constrained project scheduling, cash flow models, heuristic and metaheuristic techniques, harmony search optimization, hybrid methods, strip packing.
Summary
This paper presents an improved hybrid method for the resource-constrained project scheduling problem with discounted cash flows and strip packing like resource constraints. In the proposed approach, a resource-constrained project is characterized by its "best" schedule, where best means a makespan minimal resource-constrained schedule for which the net present value (NPV) measure is maximal and the resource profiles approach the ideal rectangular shape as much as possible. In the model the positive (negative) cash flow events are represented by dummy activities with zero duration which are connected to the finishing (starting) milestone and succeed (precede) a particular subset of "normal" activities. The algorithm is an improved conflict repairing version of the "Sounds of Silence" harmony search metaheuristic developed by Csébfalvi et al. [1,2] and Láng [3]. In the improved algorithm presented, 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 [4]. 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 cash flow events from the popular PSPLIB [5] benchmark set.
References
purchase the full-text of this paper (price £20)
go to the previous paper |
|