A memetic algorithm to address the multi-node resource-constrained project scheduling problem

Author(s):  
Luis F. Machado-Domínguez ◽  
Carlos D. Paternina-Arboleda ◽  
Jorge I. Vélez ◽  
Agustin Barrios-Sarmiento
2019 ◽  
Vol 2019 ◽  
pp. 1-16 ◽  
Author(s):  
Huafeng Dai ◽  
Wenming Cheng

This paper proposes a general variable neighborhood search-based memetic algorithm (GVNS-MA) for solving the multiskill resource-constrained project scheduling problem under linear deterioration. Integrating a solution recombination operator and a local optimization procedure, the proposed GVNS-MA is assessed on two sets of instances and achieves highly competitive results. One set of benchmark instances is commonly used in the literature where the capability of the proposed algorithm to find high quality solutions is demonstrated, compared with the state-of-the-art algorithms in the literature. The other set revises the former through incorporating the linear deterioration effect. Two key components of the proposed algorithm are investigated to confirm their critical role to the success of the proposed method.


Sign in / Sign up

Export Citation Format

Share Document