A New Genetic Algorithm for the RCPSP in Large Scale

Authors:
Hossein Zoulfaghari;Javad Nematian;Nader Mahmoudi;Mehdi Khodabandeh
Affiliations:
Department of Industrial Engineering, University of Tabriz, Tabriz, Iran;Department of Industrial Engineering, University of Tabriz, Tabriz, Iran;Department of Industrial Engineering, University of Tabriz, Tabriz, Iran;Department of Industrial Engineering, University of Tabriz, Tabriz, Iran
Venue:
International Journal of Applied Evolutionary Computation
Year:
2013

Citing 9
Cited 0

A branch-and-bound procedure for the multiple resource-constrained project scheduling problem

Management Science
New benchmark results for the resource-constrained project scheduling problem

Management Science
Resource-constrained project scheduling: a survey of recent developments

Computers and Operations Research
An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation

Management Science
Job Shop Scheduling with Genetic Algorithms

Proceedings of the 1st International Conference on Genetic Algorithms
Solving Project Scheduling Problems by Minimum Cut Computations

Management Science
A random key based genetic algorithm for the resource constrained project scheduling problem

Computers and Operations Research
An evolutionary algorithm for resource-constrained projectscheduling

IEEE Transactions on Evolutionary Computation
Project scheduling: a review of recent books

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Resource Constrained Project Scheduling Problem RCPSP is a well-studied academic problem that has been shown to be well suited to optimization via Genetic Algorithms GA. In this paper, a new method will be designed that would be able to solve RCPSP. This research area is very common in industry especially when a set of activities needs to be finished as soon as possible subject to two sets of constraints, precedence constraints and resource constraints. The presented algorithm in this paper is used to solve large scale RCPSP and improves solutions. Finally, for comparing, results are reported for the most famous classical problems that are taken from PSPLIB.