Looking for the best modes helps solving the MRCPSP/max

Journal article


Authors/Editors


Research Areas

No matching items found.


Publication Details

Author list: Ballestin F, Barrios A, Valls V
Publisher: Taylor & Francis: STM, Behavioural Science and Public Health Titles
Publication year: 2013
Volume number: 51
Issue number: 3
Start page: 813
End page: 827
Number of pages: 15
ISSN: 0020-7543
Languages: English-Great Britain (EN-GB)


Abstract

The multi-mode resource-constrained project scheduling problem with minimum and maximum time lags MRCPSP/max is a very general project scheduling problem with multiple execution modes per activity, renewable and non-renewable resources and minimum and maximum time lags between activities. In this paper, we describe SA-EVA, an algorithm for the problem. SA-EVA first searches for the best mode for each activity, without considering renewable resources. In this phase a simulated annealing is applied. Once a mode vector has been chosen, the problem reduces to the RCPSP/max, which SA-EVA solves with EVA, an algorithm designed in Ballestin etal. [2009. An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time-lags. Journal of Scheduling, 14 (4), online]. Computational results show that SA-EVA outperforms the state-of-the-art algorithms in medium and large instances.


Keywords

No matching items found.


Documents

No matching items found.

Last updated on 2019-23-08 at 11:15