Abstract
This chapter deals with the resource-constrained project scheduling problem that belongs to NP-hard optimisation problems. There are many different heuristic strategies how to shift activities in time when resource requirements exceed their available amounts. We propose a transformation of the problem to a sequence of simpler instances of (multi)knapsack problems that do not use traditionally predefined activity priorities and enable to maximise limited resources in all time intervals given by start or end of an activity and therefore to reduce the total time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
J. Blazewicz, K.H. Ecker, G. Schmidt, J. Weglarz, Scheduling Computer and Manufacturing Processes (Springer-Verlag, Berlin, 1996)
S.E. Elmaghraby, Activity Networks: Project Planning and Control by Network Models (Wiley, New York, 1977)
P. Brucker, A. Drexl, R. Möhring, K. Neumann, E. Pesch, Resource-constrained project scheduling: notation, classification, models, and methods. Eur. J. Oper. Res. 112: 3–41 (1999)
W. Herroelen, E. Demeulemeester, B.D. Reyck, A note on the paper “resource-constrained project scheduling: notation, classification, models, and methods” by Brucker et al. Eur. J. Oper. Res. 128, 679–688 (2001)
K. Bouleimen, H. Lecocq, A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. Eur. J. Oper. Res. 149, 268–281 (2003)
M. Mika, G. Waligóra, J. Weglarz, Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models. Eur. J. Oper. Res. 164, 639–668 (2005)
A. Azaron, C. Perkgoz, M. Sakawa, A genetic algorithm for the time-cost trade-off in PERT networks. Appl. Math. Comput. 168, 1317–1339 (2005)
K.W. Kim, M. Gen, G. Yamazaki, Hybrid genetic algorithm with fuzzy logic for resource-constrained project scheduling. Appl. Soft Comput. 2/3F, 174–188 (2003)
K.W. Kim, Y.S. Yun, J.M. Yoon, M. Gen, G. Yamazaki, Hybrid genetic algorithm with adaptive abilities for resource-constrained multiple project scheduling. Comput. Indus. 56, 143–160 (2005)
C. Artigues, P. Michelon, S. Reusser, Insertion techniques for static and dynamic resource-constrained project scheduling. Eur. J. Oper. Res. 149, 249–267 (2003)
V. Valls, S. Quintanilla, F. Ballestin, Resource-constrained project scheduling: a critical activity reordering heuristic. Eur. J. Oper. Res. 149, 282–301 (2003)
L.-Y. Tseng, S.-C. Chen, A hybrid metaheuristic for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 175(2), 707–721 (2006)
H. Zhang, X. Li, H. Li, F. Huang, Particle swarm optimization-based schemes for resource-constrained project scheduling. Autom. Constr. 14, 393–404 (2005)
T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to Algorithms (MIT Press, Cambridge, MA, 2001)
J. Klapka, J. Dvořák, P. Popela, Methods of Operational Research (in Czech) (VUTIUM, Brno, 2001)
C.R. Reeves, Modern Heuristic Techniques for Combinatorial Problems (Blackwell Scientific Publications, Oxford, 1993)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media B.V.
About this chapter
Cite this chapter
Šeda, M., Matoušek, R., Ošmera, P., Šandera, Č., Weisser, R. (2010). Combined Heuristic Approach to Resource-Constrained Project Scheduling Problem. In: Ao, SI., Rieger, B., Amouzegar, M. (eds) Machine Learning and Systems Engineering. Lecture Notes in Electrical Engineering, vol 68. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-9419-3_4
Download citation
DOI: https://doi.org/10.1007/978-90-481-9419-3_4
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-9418-6
Online ISBN: 978-90-481-9419-3
eBook Packages: EngineeringEngineering (R0)