This is the authors' abstract. We don't add key points for this paper.
The project selection and scheduling problem involves the allocation of limited resources to competing projects over time to optimise a given objective function. However, in practical applications, multiple criteria need to be considered, leading us to formulate the problem as a multiple objective combinatorial optimisation (MOCO) model. Activities are subject to precedence constraints, as well as a budget limiting the capital available in each planning period. Interdependencies between projects by which the selection of specific subsets of projects may result in cost savings are also represented. We propose a genetic algorithm incorporating random keys and an efficient decoding procedure into the well-known NSGA-II procedure. The performance of this algorithm is evaluated in extensive computational experiments comparing the approximations of the Pareto-optimal set it obtains to those from NSGA-II.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Summerville et al. (2015) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: