Abstract
Scheduling is a foremost vital activity broadly in most engineering fields; mostly Project Management and Operations Research. However, a more practical approach towards solving a scheduling problem would be to consider the applied constraints at hand, such as resources available at hand and other constraints. One such type of scheduling problem is the Resource-Constrained Project Scheduling Problem, abbreviated as RCPSP. The main objective of the RCPSP problem is to plan the project activities with optimal makespan keeping in view the fact that the availability of resources over the timespan of a project is limited. However, being a NP-Hard Combinatorial Optimization Problem exact methods have a problem with convergence as the problem size increases. In recent years, meta-heuristics have shown promising solutions to this problem. In this work, the usage of meta-heuristics to solve this problem is highlighted with possible future directions.
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
Artigues C (2008) The resource-constrained project scheduling problem. http://www.iste.co.uk/data/doc_dtalmanhopmh.pdf
Merkle D, Schmeck H, Middendorf M (2002) Ant colony optimization for resource-constrained project scheduling. IEEE Trans Evol Comput 6(4)
Blazewicz J, Lenstra JK, Rinnooy Kan AHG (1983) Scheduling subject to resource constraints: classification and complexity. Discret Appl Math 5(1):11–24
Hartmann S, Kolisch R (2000) Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. Eur J Oper Res 127(2):394–407
Vanhoucke M (2012) Project management with dynamic scheduling. Springer, Berlin. https://doi.org/10.1007/978-3-642-40438-2
Kolisch R (1996) Serial and parallel resource-constrained project scheduling methods revisited: theory and computation. Eur J Oper Res 90(2):320–333
Sprecher A, Kolisch R (1997) PSPLIB-a project scheduling problem library: OR software-ORSEP operations research software exchange program. Eur J Oper Res 96(1):205–216
Koulinas G, Anagnostopoulos K, Kotsikas L (2014) A particle swarm optimization based hyper-heuristic algorithm for the classic resource constrained project scheduling problem. Inf Sci 277:680–693
Kumar N, Vidyarthi DP (2016) A model for resource-constrained project scheduling using adaptive PSO. Softw Comput 20(4):1565–1580
Ziarati K, Zeighami V, Akbari R (2011) On the performance of bee algorithms for resource-constrained project scheduling problem. Appl Softw Comput 11(4):3720–3733
Marichelvam MK, Prabaharan T, Yang XS (2014) A discrete firefly algorithm for the multi-objective hybrid flowshop scheduling problems. IEEE Trans Evol Comput 18(2):301–305
Wang Z, Lu R, Chen D, Zou F (2016) An experience information teaching–learning-based optimization for global optimization. IEEE Trans Syst Man Cybern Syst 46(9):1202–1214
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Roy, B., Sen, A.K. (2019). Meta-heuristic Techniques to Solve Resource-Constrained Project Scheduling Problem. In: Bhattacharyya, S., Hassanien, A., Gupta, D., Khanna, A., Pan, I. (eds) International Conference on Innovative Computing and Communications. Lecture Notes in Networks and Systems, vol 56. Springer, Singapore. https://doi.org/10.1007/978-981-13-2354-6_11
Download citation
DOI: https://doi.org/10.1007/978-981-13-2354-6_11
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-2353-9
Online ISBN: 978-981-13-2354-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)