Looking for the best modes helps solving the MRCPSP/max |
| |
| Authors: | Francisco Ballestín Agustín Barrios Vicente Valls |
| |
| Affiliation: | 1. Department of Mathematics for the Economy and Business , University of Valencia , Valencia , Spain francisco.ballestin@uv.es;3. Department of Mathematics and Statistics , Universidad del Norte , Barranquilla , Colombia;4. Department of Mathematics for the Economy and Business , University of Valencia , Valencia , Spain |
| |
| 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 Ballestín et al. 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: | resource-constrained project scheduling maximum time lags multi-mode case simulated annealing |
|
|
