caa a22 4500 44583871X CHVBK 20180317145337.0 cr unu---uuuuu 170323e20110801xx s 000 0 eng 10.1007/s10951-009-0125-9 doi (NATIONALLICENCE)springer-10.1007/s10951-009-0125-9 An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time lags [Elektronische Daten] [Francisco Ballestín, Agustín Barrios, Vicente Valls] In this paper, we present an evolutionary algorithm (EVA) for solving the resource-constrained project scheduling problem with minimum and maximum time lags (RCPSP/max). EVA works on a population consisting of several distance-order-preserving activity lists representing feasible or infeasible schedules. The algorithm uses the conglomerate-based crossover operator, the objective of which is to exploit the knowledge of the problem to identify and combine those good parts of the solution that have really contributed to its quality. In a recent paper, Valls etal. (European J. Oper. Res. 165, 375-386, 2005) showed that incorporating a technique called double justification (DJ) in RCPSP heuristic algorithms can produce a substantial improvement in the results obtained. EVA also applies two double justification operators DJmax and DJU adapted to the specific characteristics of problem RCPSP/max to improve all solutions generated in the evolutionary process. Computational results in benchmark sets show the merit of the proposed solution method. Springer Science+Business Media, LLC, 2009 Resource-constrained project scheduling nationallicence Maximum time lags nationallicence Meta-heuristic algorithms nationallicence Ballestín Francisco Dept. de Estadística e Investigación Operativa, Universidad Pública de Navarra, 31006, Pamplona, Spain aut Barrios Agustín Dept. de Matemáticas y Física, Universidad del Norte, Barranquilla, Colombia aut Valls Vicente Dept. de Estadística e Investigación Operativa, Universidad de Valencia, 46100, Burjasot, Spain aut Journal of Scheduling Springer US; http://www.springer-ny.com 14/4(2011-08-01), 391-406 1094-6136 14:4<391 2011 14 10951 https://doi.org/10.1007/s10951-009-0125-9 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s10951-009-0125-9 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Ballestín Francisco Dept. de Estadística e Investigación Operativa, Universidad Pública de Navarra, 31006, Pamplona, Spain aut NATIONALLICENCE 700 1- Barrios Agustín Dept. de Matemáticas y Física, Universidad del Norte, Barranquilla, Colombia aut NATIONALLICENCE 700 1- Valls Vicente Dept. de Estadística e Investigación Operativa, Universidad de Valencia, 46100, Burjasot, Spain aut NATIONALLICENCE 773 0- Journal of Scheduling Springer US; http://www.springer-ny.com 14/4(2011-08-01), 391-406 1094-6136 14:4<391 2011 14 10951 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer