Solving resource-constrained project scheduling problem by a genetic local search approach

Abstract

The resource-constrained project scheduling problem is a general scheduling problem which involving activities need to be scheduled such that the makespan is minimized. However, the RCPSP is confirmed to be an NP-hard combinatorial problem. Restated, it is hard to be solved in a reasonable computational time. Therefore, numerous metaheuristics-based… (More)

Topics

5 Figures and Tables

Slides referencing similar topics