A hybrid approach for solving multi-mode resource-constrained project scheduling problem in construction
Abstract: Practical problems in construction can be easily qualified as NP-hard (non-deterministic, polynomial-time hard) problems. The time needed for solving these problems grows exponentially with the increase of the problem’s size – this is why mathematical and heuristic methods do not enable finding solutions to complicated construction problems within an acceptable period of time. In the view of many authors, metaheuristic algorithms seem to be the most appropriate measures for scheduling and task sequencing. However even metaheuristic approach does not guarantee finding the optimal solution and algorithms tend to get stuck around local optima of objective functions. This is why authors considered improving the metaheuristic approach by the use of neural networks. In the article, authors analyse possible benefits of using a hybrid approach with the use of metaheuristics and neural networks for solving the multi-mode, resource-constrained, project-scheduling problem (MRCPSP). The suggested approach is described and tested on a model construction project schedule. The results are promising for construction practitioners, the hybrid approach improved results in 87% of tests. Based on the research outcomes, authors suggest future research ideas.
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
A hybrid approach for solving multi-mode resource-constrained project scheduling problem in construction ; volume:9 ; number:1 ; year:2019 ; pages:7-13 ; extent:7
Open engineering ; 9, Heft 1 (2019), 7-13 (gesamt 7)
- Urheber
-
Rosłon, Jerzy Hubert
Kulejewski, Janusz Edward
- DOI
-
10.1515/eng-2019-0006
- URN
-
urn:nbn:de:101:1-2412141702460.422712164422
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:21 MESZ
Datenpartner
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Rosłon, Jerzy Hubert
- Kulejewski, Janusz Edward
Ähnliche Objekte (12)
Nonpreemptive multi-mode resource-constrained project scheduling
Hybrid multimode resource-constrained maintenance project scheduling problem
Multimode resource-constrained project scheduling in flexible projects
Local search for nonpreemptive multi-mode resource-constrained project scheduling
Resource-constrained project scheduling : a heuristic for the multi-mode case
Stochastic resource-constrained project scheduling
Exakte Methoden und Matheuristiken für das Multi-Mode Resource-Constrained Project Scheduling Problem
A Mode Reduction Technique for the Multi-Mode Resource-Constrained Project Scheduling Problem
New insights on the complexity of resource-constrained project scheduling: Two cases of multi-mode scheduling
Solving Multi-Mode Resource-Constrained Project Scheduling Problems by a Simple, General and Powerful Sequeacing Algorithm. Part II: Computation
Solving Multi-Mode Resource-Constrained Project Scheduling Problems by a Simple, General and Powerful Sequeacing Algorithm. Part I: Theory
Pre-emptive resource-constrained multimode project scheduling using genetic algorithm: A dynamic forward approach
Nonpreemptive multi-mode resource-constrained project scheduling
Hybrid multimode resource-constrained maintenance project scheduling problem
Multimode resource-constrained project scheduling in flexible projects
Local search for nonpreemptive multi-mode resource-constrained project scheduling
Resource-constrained project scheduling : a heuristic for the multi-mode case
Stochastic resource-constrained project scheduling
Exakte Methoden und Matheuristiken für das Multi-Mode Resource-Constrained Project Scheduling Problem
A Mode Reduction Technique for the Multi-Mode Resource-Constrained Project Scheduling Problem
New insights on the complexity of resource-constrained project scheduling: Two cases of multi-mode scheduling
Solving Multi-Mode Resource-Constrained Project Scheduling Problems by a Simple, General and Powerful Sequeacing Algorithm. Part II: Computation
Solving Multi-Mode Resource-Constrained Project Scheduling Problems by a Simple, General and Powerful Sequeacing Algorithm. Part I: Theory
Pre-emptive resource-constrained multimode project scheduling using genetic algorithm: A dynamic forward approach
Nonpreemptive multi-mode resource-constrained project scheduling
Hybrid multimode resource-constrained maintenance project scheduling problem
Multimode resource-constrained project scheduling in flexible projects
Local search for nonpreemptive multi-mode resource-constrained project scheduling
Resource-constrained project scheduling : a heuristic for the multi-mode case
Stochastic resource-constrained project scheduling
Exakte Methoden und Matheuristiken für das Multi-Mode Resource-Constrained Project Scheduling Problem
A Mode Reduction Technique for the Multi-Mode Resource-Constrained Project Scheduling Problem
New insights on the complexity of resource-constrained project scheduling: Two cases of multi-mode scheduling
Solving Multi-Mode Resource-Constrained Project Scheduling Problems by a Simple, General and Powerful Sequeacing Algorithm. Part II: Computation
Solving Multi-Mode Resource-Constrained Project Scheduling Problems by a Simple, General and Powerful Sequeacing Algorithm. Part I: Theory