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

5 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

Fingerprint

Project Scheduling
Biased
Scheduling Problem
Genetic algorithms
Scheduling
Genetic Algorithm
Resource-constrained Project Scheduling
Resources
Combinatorial Optimization Problem
Decoding
Combinatorial optimization
Heuristics
Benchmark
Minimise
Unit
Computing
Evidence
Skills

Keywords

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

Cite this

Almeida, Bernardo F. ; Saldanha-da-Gama, Francisco ; Correia, Isabel. / A biased random-key genetic algorithm for the project scheduling problem with flexible resources. In: TOP. 2018 ; pp. 1-26.
@article{81ded68adfd943f7b102be2db2dc3252,
title = "A biased random-key genetic algorithm for the project scheduling problem with flexible resources",
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.",
keywords = "Biased random-key genetic algorithm, Flexible resources, Resource-constrained project scheduling",
author = "Almeida, {Bernardo F.} and Francisco Saldanha-da-Gama and Isabel Correia",
note = "info:eu-repo/grantAgreement/FCT/5876/147209/PT# info:eu-repo/grantAgreement/FCT/5876/147204/PT# sem pdf conforme despacho.",
year = "2018",
month = "4",
day = "16",
doi = "10.1007/s11750-018-0472-9",
language = "English",
pages = "1--26",
journal = "TOP",
issn = "1134-5764",
publisher = "Springer Science Business Media",

}

A biased random-key genetic algorithm for the project scheduling problem with flexible resources. / Almeida, Bernardo F.; Saldanha-da-Gama, Francisco; Correia, Isabel.

In: TOP, 16.04.2018, p. 1-26.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Almeida, Bernardo F.

AU - Saldanha-da-Gama, Francisco

AU - Correia, Isabel

N1 - info:eu-repo/grantAgreement/FCT/5876/147209/PT# info:eu-repo/grantAgreement/FCT/5876/147204/PT# sem pdf conforme despacho.

PY - 2018/4/16

Y1 - 2018/4/16

N2 - 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.

AB - 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.

KW - Biased random-key genetic algorithm

KW - Flexible resources

KW - Resource-constrained project scheduling

UR - http://www.scopus.com/inward/record.url?scp=85045456587&partnerID=8YFLogxK

U2 - 10.1007/s11750-018-0472-9

DO - 10.1007/s11750-018-0472-9

M3 - Article

SP - 1

EP - 26

JO - TOP

JF - TOP

SN - 1134-5764

ER -