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

Full Bibliographic Reference for this paper
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
1
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), "Project Management and Scheduling 2008", Istanbul, Turkey, 56-59, 2008.
2
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), "Project Management and Scheduling 2008", Istanbul, Turkey, 60-63, 2008.
3
E. Szendroi, "A Hybrid Method for the Multi-Mode Resource-Constrained Project Scheduling Problem", 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, United Kingdom, paper 3, 2009. doi:10.4203/ccp.92.3
4
G. Csébfalvi and P. Konstantinidis, "A new exact resource balancing procedure for the multiple resource-constrained project scheduling problem", in "Proceedings of APMOD '98", Limasol, Cyprus, 11-13 March, 1998.
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 previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £125 +P&P)