Authors: André Renato Villela Da Silva; Luiz Satoru Ochi
Addresses: Computing Department, Institute of Science and Technology (PURO), Federal Fluminense University, Rua Recife s/n – Jardim Bela Vista, 28890-000, Rio das Ostras, Rio de Janeiro, Brazil ' Institute of Computer Science, Federal Fluminense University, Rua Passo da Pátria, 156 – Bloco E – 3° andar – Boa Viagem, 24210-240, Niterói, Rio de Janeiro, Brazil
Abstract: In this paper, we present a variant of classical scheduling problems which deal with restricted resources. Unlike other models studied in the literature, the proposed model has no upper bound for the amount of available resources. The objective of this variant is to find a solution that maximises this amount at the end of the planning horizon. A hybrid evolutionary algorithm is proposed for this problem presenting very promising computational results.
Keywords: project scheduling; evolutionary algorithms; mathematical formulation; metaheuristics; dynamic scheduling; resource constrained projects.
International Journal of Data Mining, Modelling and Management, 2013 Vol.5 No.4, pp.370 - 379
Received: 08 May 2021
Accepted: 12 May 2021
Published online: 18 Nov 2013 *