Combined Heuristic Approach to Resource-Constrained Project Scheduling Problem
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.
KeywordsSchedule Problem Simulated Annealing Knapsack Problem Network Graph Starting Vertex
- 12.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)Google Scholar
- 15.J. Klapka, J. Dvořák, P. Popela, Methods of Operational Research (in Czech) (VUTIUM, Brno, 2001)Google Scholar