A CPM Based Heuristic For Multi-resource Constrained Project Scheduling Problem

Resource-constrained project scheduling problem is a typical issue in project scheduling management. As precedence relations and resource constraints must be considered concurrently, this problem is so difficult to solve completely that it belongs to NP-hard. After reviewing the development history and researching actuality of RCPSP, this paper brings forward a new heuristic ? a MIN-Q based heuristic for multi-resource constrained project scheduling problem combining with CPM and seriation optimization theory of parallel activities, the algorithm for the method is also proposed. Finally, an evaluation system for heuristic methods for multi-resource-constrained project scheduling problem is constructed and the article proves the solutions are of optimization and execution efficiency, through computational comparison with the good heuristics in existence.