A biased random-key genetic algorithm for the project scheduling problem with flexible resources

作者：Almeida Bernardo F^*; Correia Isabel; Saldanha da Gama Francisco

来源：Top, 2018, 26(2): 283-308.

DOI：10.1007/s11750-018-0472-9

• Resource-constrained project scheduling
• Flexible resources
• Biased random-key genetic algorithm

In this paper, we investigate a resource-constrained project scheduling problem with flexible resources. This is an -hard combinatorial optimization problem that consists of scheduling a set of activities requiring specific resource units of several skills. The goal is to minimize the makespan of the project. We propose a biased random-key genetic algorithm for computing feasible solutions for the referred problem. We study different decoding mechanisms: an already existing method in the literature, a new adapted serial scheduling generation scheme, and a combination of both. The new procedure is tested using a set of benchmark instances of the problem. The results provide strong evidence that the new heuristic is robust and yields high-quality feasible solutions.

• 出版日期2018-7