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 93
A Hybrid Method for the Multi-Mode Resource-Constrained Project Scheduling Problem with Strip Packing like Resource Constraints E. Szendroi
University of Pécs, Hungary E. Szendroi, "A Hybrid Method for the Multi-Mode Resource-Constrained Project Scheduling Problem with Strip Packing like Resource Constraints", in , (Editors), "Proceedings of the Seventh International Conference on Engineering Computational Technology", Civil-Comp Press, Stirlingshire, UK, Paper 93, 2010. doi:10.4203/ccp.94.93
Keywords: multi-mode resource-constrained project scheduling, heuristic and metaheuristic techniques, harmony search optimization, hybrid methods, resource leveling, strip packing.
Summary
This paper presents a hybrid algorithm for the multi-mode resource-constrained project scheduling problem (MRCPSP) with strip packing like resource constraints. In the proposed primary-secondary criteria approach, a resource-constrained project is characterized by its "best" schedule, where best means a makespan minimal resource-constrained schedule for which the resource profiles approach the ideal rectangular shape as much as possible. In the proposed model the activities are assigned to the same resource units over their processing times. In the traditional resource-constrained project scheduling the activities are not necessarily assigned to the same resource units over their processing times, so an "optimal" solution may be far from the reality. The algorithm is an improved version of the "sounds of Silence" harmony search metaheuristic developed by Csébfalvi et al. [1,2] and Szendroi [3]. In the presented improved algorithm the harmony search is combined with a resource leveling-assigning procedure based on a mixed integer linear programming (MILP) formulation [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 the detailed computational results for project instance J30MM-10-1 from the popular PSPLIB [5] benchmark set.
References
purchase the full-text of this paper (price £20)
go to the previous paper |
|