A New Genetic Algorithm for the RCPSP in Large Scale

2013 ◽  
Vol 4 (2) ◽  
pp. 29-40 ◽  
Author(s):  
Hossein Zoulfaghari ◽  
Javad Nematian ◽  
Nader Mahmoudi ◽  
Mehdi Khodabandeh
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Project Scheduling ◽  
Large Scale ◽  
Resource Constraints ◽  
Research Area ◽  
New Method ◽  
Scheduling Problem ◽  
Academic Problem ◽  
Project Scheduling Problem

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.

scholarly journals Review of conventional metaheuristic techniques for resource-constrained project scheduling problem

2022 ◽  
Vol 7 (2) ◽  
pp. 95-110 ◽  
Author(s):  
Amir Golab ◽  
Ehsan Sedgh Gooya ◽  
Ayman Al Falou ◽  
Mikael Cabon
Keyword(s):  
Genetic Algorithms ◽  
Project Scheduling ◽  
Resource Constraints ◽  
Heuristic Algorithms ◽  
Single Mode ◽  
Scheduling Problem ◽  
Resource Constrained ◽  
Heuristic Solution ◽  
Resource Constrained Project Scheduling ◽  
Project Scheduling Problem

This paper is concerned with an overview of the Resource-Constrained Project Scheduling Problem (RCPSP) and the conventional meta-heuristic solution techniques that have attracted the attention of many researchers in the field. Therefore, researchers have developed algorithms and methods to solve the problem. This paper addresses the single-mode RCPSP where the objective is to optimize and minimize the project duration while the quantities of resources are constrained during the project execution. In this problem, resource constraints and precedence relationships between activities are known to be the most important constraints for project scheduling. In this context, the standard RCPSP is presented. Then, the classifications of the collected papers according to the year of publication and the different meta-heuristic approaches applied are presented. Five weighted articles and their meta-heuristic techniques developed for RCPSP are described in detail and their results are summarized in the corresponding tables. In addition, researchers have developed various conventional meta-heuristic algorithms such as genetic algorithms, particle swarm optimization, ant colony optimization, bee colony optimization, simulated annealing, evolutionary algorithms, and so on. It is stated that genetic algorithms are more popular among researchers than other meta-heuristics. For this reason, the various conventional meta-heuristics and their corresponding articles are also presented to give an overview of the conventional meta-heuristic optimizing techniques. Finally, the challenges of the conventional meta-heuristics are explored, which may be helpful for future studies to apply new suitable techniques to solve the Resource-Constrained Project Scheduling Problem (RCPSP).

Development of Hybrid Genetic Algorithms for the Resource Constrained Multi-Project Scheduling Problem

2005 ◽  
Author(s):  
Wenjian Liu ◽  
Jinghua Li
Keyword(s):  
Genetic Algorithm ◽  
Project Scheduling ◽  
Resource Constraints ◽  
Hybrid Genetic Algorithm ◽  
Second Phase ◽  
Scheduling Problem ◽  
Priority Rules ◽  
Resource Constrained ◽  
Chromosome Representation ◽  
Project Scheduling Problem

In multi-project environment, multiple projects share and compete for the limited resources to achieve their own goals. Besides resource constraints, there exist precedence constraints among activities within each project. This paper presents a hybrid genetic algorithm to solve the resource-constrained multi-project scheduling problem (RCMPSP), which is well known NP-hard problem. Objectives described in this paper are to minimize total project time of multiple projects. The chromosome representation of the problem is based on activity lists. The proposed algorithm was operated in two phases. In the first phase, the feasible schedules are constructed as the initialization of the algorithm by permutation based simulation and priority rules. In the second phase, this feasible schedule was optimized by genetic algorithm, thus a better approximate solution was obtained. Finally, after comparing several different algorithms, the validity of proposed algorithm is shown by a practical example.

Sign in / Sign up

Export Citation Format

Share Document