Looking for the best modes helps solving the MRCPSP/max

Article de journal


Auteurs / Editeurs


Domaines de Recherche

Pas d'articles correspondants trouvés.


Détails sur la publication

Liste des auteurs: Ballestin F, Barrios A, Valls V
Editeur: Taylor & Francis: STM, Behavioural Science and Public Health Titles
Année de publication: 2013
Numéro du volume: 51
Numéro de publication: 3
Page d'accueil: 813
Dernière page: 827
Nombre de pages: 15
ISSN: 0020-7543
Languages: Anglais-Royaume-Uni (EN-GB)


Résumé

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.


Mots-clés

Pas d'articles correspondants trouvés.


Documents

Pas d'articles correspondants trouvés.

Dernière mise à jour le 2019-23-08 à 11:15