Using an enhanced scatter search algorithm for a resource-constrained project scheduling problem

Authors:
M. D. Mahdi Mobini;M. Rabbani;M. S. Amalnik;J. Razmi;A. R. Rahimi-Vahed
Affiliations:
University of Tehran, Department of Industrial Engineering, P.O. Box 11365, 4563, Tehran, Iran;University of Tehran, Department of Industrial Engineering, P.O. Box 11365, 4563, Tehran, Iran;University of Tehran, Department of Industrial Engineering, P.O. Box 11365, 4563, Tehran, Iran;University of Tehran, Department of Industrial Engineering, P.O. Box 11365, 4563, Tehran, Iran;University of Montreal, Center for Research on Transportation, P.O.Box 6128, Succursale Centre-ville, H3C 3J7, Montreal, Canada
Venue:
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Year:
2009

Citing 0
Cited 6

An efficient hybrid algorithm for resource-constrained project scheduling

Information Sciences: an International Journal
A Neurogenetic approach for the resource-constrained project scheduling problem

Computers and Operations Research
An accelerating two-layer anchor search with application to the resource-constrained project scheduling problem

IEEE Transactions on Evolutionary Computation
An Artificial Immune Algorithm for the project scheduling problem under resource constraints

Applied Soft Computing
Solving project scheduling problems with resource constraints via an event list-based evolutionary algorithm

Expert Systems with Applications: An International Journal
Integrating iterative crossover capability in orthogonal neighborhoods for scheduling resource-constrained projects

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The resource-constrained project scheduling problem is one of the classical problems in the field of operations research. There are many criteria to efficiently determine the desired schedule of a project. In this paper, a well-known criterion namely project’s makespan is considered. Due to the complexity of the problem, it is very difficult to obtain optimum solution for this kind of problems by means of traditional methods. Therefore, an enhanced scatter search, based on a new path relinking and two prominent permutation-based and crossover operators, is devised to solve the problem. In order to validate the performance of the proposed algorithm, in terms of solution quality, the algorithm is applied to various test problems available on the literature and the reliability of it, is compared with well-reported benchmark algorithms. The computational results reveal that the proposed algorithm has appropriate results in comparison with the existing benchmark algorithms.