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

Bernardo F. Almeida, Francisco Saldanha-da-Gama, Isabel Correia

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

In this paper, we investigate a resource-constrained project scheduling problem with flexible resources. This is an (Formula presented.)-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.

Original languageEnglish
Pages (from-to)1-26
Number of pages26
JournalTOP
DOIs
Publication statusAccepted/In press - 16 Apr 2018

Keywords

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

Fingerprint Dive into the research topics of 'A biased random-key genetic algorithm for the project scheduling problem with flexible resources'. Together they form a unique fingerprint.

  • Cite this