Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A genetic algorithm for resource leveling of construction projects
Date
2012-01-01
Author
Iranagh, Mahdi Abbasi
Sönmez, Rifat
Metadata
Show full item record
Item Usage Stats
308
views
0
downloads
Cite This
Critical path method (CPM) is commonly used in scheduling of construction projects. However, CPM only considers the precedence relations between the activities and does not consider resource optimization during scheduling of projects. Optimal allocation of resources can be achieved by resource levelling. Resource levelling is crucial for effective use of construction resources particularly to minimize the project costs. However, commercial scheduling software has very limited capabilities for solving the resource levelling problem. In this study a genetic algorithm (GA) is developed for the resource levelling problem. The performance of GA is compared with the performance of Microsoft Project 2010 for several sample projects. The comparisons indicate that the GA outperforms resource levelling heuristic of Microsoft Project 2010 significantly. Furthermore, exact solutions were obtained for the sample problems using linear-integer programming technique. Exact solutions reveal that the algorithm is capable of achieving adequate solutions. Hence, the GA provides a powerful alternative for the resource levelling problem.
Subject Keywords
Project management
,
Resource levelling
,
Genetic algorithms
,
Optimization
URI
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84911874180&origin=inward
https://hdl.handle.net/11511/76647
Collections
Department of Civil Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
The Resource allocation capabilities of commercial construction project management software for the resource leveling problem /
Rezvan Khah, Emad; Sönmez, Rifat; Atan, S. Tankut; Department of Civil Engineering (2014)
Critical path method (CPM) has been commonly used for scheduling of construction projects. However, CPM only considers the relations between the activities, but does not optimize the resource allocation. Resource leveling problem (RLP) concentrates on optimizing resource utilization histograms obtained by Critical Path Method (CPM) without changing the project duration. Resource leveling is crucial for effective use of construction resources particularly, manpower and machinery resources to minimize the pro...
An exploratory study on utilization of BIM for risk management
Kaya, Hazal Deniz; Dikmen, İrem; Atasoy, Güzide; Birgönül, Mustafa Talat (İstanbul Teknik Üniversitesi; 2020-11-14)
It is a well-known fact that BIM application in construction projects enables several advantages such as better collaboration and communication, effective project visualization before construction, more efficient cost estimation and scheduling, and an increase in productivity. Although many of these advantages that BIM contributes to construction projects may result in opportunities for better risk management, there are limited studies in the construction management literature that investigate this subject....
A genetic algorithm for the resource constrained project scheduling problem
Özleyen, Erdem; Sönmez, Rifat; Department of Civil Engineering (2011)
The resource-constrained project scheduling problem (RCPSP) aims to find a schedule of minimum makespan by starting each activity such that resource constraints and precedence constraints are respected. However, as the problem is NP-hard (Non-Deterministic Polynomial-Time Hard) in the strong sense, the performance of exact procedures is limited and can only solve small-sized project networks. In this study a genetic algorithm is proposed for the RCPSP. The proposed genetic algorithm (GA) aims to find near-o...
A mixed integer model for optimization of discrete time cost tradeoff problem
Tatar, Ali Can; Bilir, Mert; Sönmez, Rifat; Atan, Sabri Tankut (null; 2016-06-25)
In construction projects, activity durations can be expedited by allocating additional resources. Decreasing activity durations by means of crashing, usually leads to increase in the direct expenses. This trade-off between time and cost is called as the time-cost trade-off problem. Since in practice many resources are available in discrete units, numerous research has focussed on the discrete version of this problem called the discrete time-cost trade-off problem (DTCTP). Achieving the project schedule that...
Hybrid meta-heuristic algorithms for the resource constrained multi-project scheduling problem
Uysal, Furkan; Sönmez, Rifat; Department of Civil Engineering (2014)
The general resource constrained multi-project scheduling problem (RCMPSP) consists of simultaneous scheduling of two or more projects with common resource constraints, while minimizing duration of the projects. Critical Path Method and other scheduling methods do not consider resource conflicts and practically used commercial project management software packages and heuristic methods provide very limited solutions for the solution of the RCMPSP. Considering the practical importance of multi-project schedul...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. A. Iranagh and R. Sönmez, “A genetic algorithm for resource leveling of construction projects,” 2012, vol. 2, Accessed: 00, 2021. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84911874180&origin=inward.
