6533b827fe1ef96bd128598a

RESEARCH PRODUCT

A multi-objective approach for a project scheduling problem with due dates and temporal constraints infeasibilities

ÁNgeles PérezSacramento QuintanillaPilar LinoVicente Valls

subject

Mathematical optimizationComputer scienceStrategy and Managementmedia_common.quotation_subjectTardinessEvolutionary algorithmManagement Science and Operations ResearchMulti-objective optimizationIndustrial and Manufacturing EngineeringResource (project management)Work (electrical)Genetic algorithmObjective approachQuality (business)media_common

description

In this paper, we study a multi-mode resource-constrained project scheduling problem (RCPSP) which considers time and work generalised precedence relationships with minimal and maximal time lags and due dates where each activity requires only one unit of resource (e.g. a worker, a machine, etc.). To find a feasible solution for this problem is NP-hard and therefore for instances where a feasible solution has not been found, an appropriate real-life approach would consist of providing the decision-maker with a collection of quality solutions with a trade-off between due dates and temporal constraints violations. We propose a multi-objective evolutionary algorithm for the generation of an approximation to the optimal Pareto front with the objectives of minimising the project tardiness, and the time and work precedence relationships infeasibilities. The algorithm is basically a genetic algorithm with a multi-objective management of the evolution and is complemented by several local searches. Local Searches a...

https://doi.org/10.1080/00207543.2014.923120