Journal
JOURNAL OF MANUFACTURING SYSTEMS
Volume 63, Issue -, Pages 506-523Publisher
ELSEVIER SCI LTD
DOI: 10.1016/j.jmsy.2022.05.002
Keywords
Resource-constrained project scheduling; problem; Time-dependent resource costs; Makespan; Multi-objective optimization; Exact Pareto front; Metaheuristics
Categories
Funding
- Ministerio de Ciencia e Innovacion/Agencia Estatal de Investigacion, Spain [PID2019-105952GB-I00]
- government of the Valencian Community, Spain [PROMETEO/2021/063]
- National Funding from FCT-Fundacao para a Ciencia e Tecnologia, Portugal [UIDB/04561/2020]
- Fundação para a Ciência e a Tecnologia [UIDB/04561/2020] Funding Source: FCT
Ask authors/readers for more resources
This work provides new insights on bi-criteria resource-constrained project scheduling problems. It presents a realistic problem definition and optimization model, followed by the development of an algorithm and a metaheuristic algorithm to solve the problem.
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. Timedependent 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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available