Solution algorithms for the project selection and scheduling problem with resource constraints and time dependent returns

Pezhman Ghahremani and Bahman Naderi

International Journal of Industrial and Systems Engineering, 2015, vol. 19, issue 3, 348-363

Abstract: This paper considers the problem of resource constrained project selection and scheduling with a limited planning horizon and time-dependent return. The objective is to select a set of projects that maximise the present worth of profit. We first mathematically formulate the problem and compare the model with the adaptation of an available model for a similar problem. To solve the problem, we employ five novel metaheuristics based on genetic and iterated greedy algorithms. We propose a novel effective constructive heuristic to produce initial solution for the algorithm and a novel crossover operator. A comprehensive experiment is established with small and large sized instances to compare and evaluate the performance of the proposed model and algorithms. All the results show the effectiveness of the model and algorithms.

Keywords: project selection; project scheduling; genetic algorithms; iterated greedy algorithm; IGA; mixed integer programming; time dependent returns; resource constraints. (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=68200 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:19:y:2015:i:3:p:348-363

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().