Abstract
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).
Highlights
In the last few decades, the resource constrained project scheduling problem (RCPSP) and its solution techniques have been studied
It was pointed out that the conventional metaheuristics are more practical than exact methods to deal with large-size problems
It was noticed that there is a lack of investigating the problem using new methods such as neural networks and machine learning
Summary
In the last few decades, the resource constrained project scheduling problem (RCPSP) and its solution techniques have been studied. RCPSP is a problem that focuses on optimizing and minimizing the total makespan of a project while resources are constrained In this context, resource constraints and precedence relations between activities are known to be major constraints in project scheduling. (2) The first one means that activity j cannot be started until its immediate predecessors have been completed In this case, a precedence feasible project schedule is achieved. - The set of Pred consisting of ordered pairs (A , A ) shows that A is an immediate predecessor of A - r represents the amount of renewable resources consumed by activity j.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
