Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Frequently Asked Questions
Frequently Asked Questions
Communities & Collections
Communities & Collections
Backward-Forward Hybrid Genetic Algorithm for Resource-Constrained Multiproject Scheduling Problem
Date
2015-09-01
Author
Sönmez, Rifat
Uysal, Furkan
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
6
views
0
downloads
Despite the fact that companies manage multiple projects simultaneously, most research on resource-constrained project scheduling has focused on single projects. This paper presents a backward-forward hybrid genetic algorithm (BFHGA) for optimal scheduling of a resource-constrained multiproject scheduling problem (RCMPSP). The new approach combines complementary strengths of the backward-forward scheduling method, genetic algorithms, and simulated annealing. BFHGA was tested on four single-project case examples, one portfolio case example, one real portfolio, and 26 test portfolio instances. The proposed algorithm obtained the best solution for all of the single-project case examples, and outperformed five state-of-the-art meta-heuristics and five popular heuristics for the resource-constrained multiproject scheduling problems. The computational results show that the BFHGA is a fast and effective algorithm for scheduling multiple projects with common limited resources. The performance gap between the BFHGA and popular heuristics reveals the potential for improving the existing heuristics for the RCMPSP. (C) 2014 American Society of Civil Engineers.
Subject Keywords
Civil and Structural Engineering
,
Computer Science Applications
URI
https://hdl.handle.net/11511/36630
Journal
JOURNAL OF COMPUTING IN CIVIL ENGINEERING
DOI
https://doi.org/10.1061/(asce)cp.1943-5487.0000382
Collections
Department of Civil Engineering, Article