Title: Solution algorithms for the project selection and scheduling problem with resource constraints and time dependent returns
Authors: Pezhman Ghahremani; Bahman Naderi
Addresses: Department of Industrial Engineering, Faculty of Industrial and Mechanical Engineering, Islamic Azad University, Qazvin Branch, Pazhohesh Blv., Qazvin, Iran ' Department of Industrial Engineering, Faculty of Engineering, University of Kharazmi, Hesarak St. Karaj, Iran
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.
International Journal of Industrial and Systems Engineering, 2015 Vol.19 No.3, pp.348 - 363
Available online: 11 Mar 2015 *Full-text access for editors Access for subscribers Purchase this article Comment on this article