J. Alcaraz, L. Anton-Sanchez, F. Saldanha-da-Gama
This work provides new insights on bi-criteria resource-constrained project scheduling problems. We define a realistic problem where the objectives to combine are the makespan and the total cost for resource usage. Time-dependent costs are assumed for the resources, i.e., they depend on when a resource is used. An optimization model is presented and it is followed by the development of an algorithm aiming at finding the set of Pareto solutions. The intractability of the optimization models underlying the problem also justifies the development of a metaheuristic for approximating the same front. We design a bi-objective evolutionary algorithm that includes problem-specific knowledge and is based on the Non-dominated Sorting Genetic Algorithm (NSGA-II). The results of extensive computational experiments performed using instances built from those available in the literature are reported. The results demonstrate the efficiency of the metaheuristic proposed.
Palabras clave: Resource-constrained project scheduling problem, time-dependent resource costs, makespan, multi-objective optimization, exact Pareto front, metaheuristics
Programado
GT22 Producción
8 de junio de 2022 17:20
A11
