Affiliation:
1. Department of Industrial Engineering, University of Tabriz, Tabriz, Iran
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.
Subject
General Earth and Planetary Sciences,General Environmental Science
Reference45 articles.
1. Alcaraz, J., Maroto, C., & Ruiz, R. (2004). Improving the performance of genetic algorithms for RCPSP problem. In Proceedings of the Ninth International Workshop on Project Management and Scheduling (pp. 40-43).
2. Some efficient multi-heuristic procedures for resource-constrained project scheduling
3. Resource-constrained project scheduling by simulated annealing
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献