2022/03/23 by Jorge Magalhães-Mendes, Magalhães-Mendes, J.
Decision Sciences · Engineering · #Resource-Constrained Project Scheduling #Scheduling and Optimization Algorithms #Scheduling and Timetabling Solutions
paper · doi:10.26537/r4239
openalex publication_date 2022/03/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/01
- The resource constrained project scheduling problem (RCPSP) is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. During the last couple of years many heuristic procedures have been developed for this problem, but still these procedures often fail in finding near-optimal solutions. This paper proposes a genetic algorithm for the resource constrained project scheduling problem. The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities and delay times of the activities are defined by the genetic algorithm. The approach was tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm