Multi-Project Multi-Resource Leveling Using Mixed Integer Programming

Date

2018-11-16

Author

Altun, Murat
Sönmez, Rifat
Akçamete Güngör, Aslı

Metadata

Show full item record

Item Usage Stats

235
views

0
downloads

In construction projects, resource leveling aims to provide efficient resource planning during project implementation by reducing possible fluctuations in resource usage. Decision makers mostly focus on the single project to optimize its resource usage by applying various objective functions of resource leveling problem. However, in real life, multiple projects may be performed in the same time period. Hence, leveling the resources of each project separately generates sub-optimal solutions since interactions between projects due to common resource usages are ignored. Therefore, the projects with shared resources should be leveled together to reach the global optimum solution. In this study, an optimization model is developed using Mixed Integer Programming (MIP) to minimize peak usage of multiple types of trades in multiple construction projects. Performance of the model is tested with two 300-activity construction projects and three different resource trades. The results show that MIP model offers the optimal solution to the tested multi-project multi-resource leveling problem.

Subject Keywords

Multiple project, Resource leveling, Shared resource optimization, Scheduling, Mixed integer programming

URI

http://pcmc2018.ciu.edu.tr/index.php/ipcmc-2018-proceedings/
https://hdl.handle.net/11511/72458

Conference Name

5th International Project and Construction Management Conference IPCMC2018 (16 - 18 Kasım 2018)

Collections

Department of Civil Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Development of high performance heuristic and meta-heuristic methods for resource optimization of large scale construction projects Abbasi Iranagh, Mahdi; Sönmez, Rifat; Department of Civil Engineering (2015) Despite the importance of resource optimization in construction scheduling, very little success has been achieved in solving the resource leveling problem (RLP) and resource constrained discrete time-cost trade-off problem (RCDTCTP), especially for large-scale projects. The major objective of this thesis is to design and develop new heuristic and meta-heuristic methods to achieve fast and high quality solutions for the large-scale RLP and RCDTCTP. Two different methods are presented in this thesis for the R...
Resource Constrained Multi-project Scheduling: Application in Software Company Kurt, Pelin Akyil; KEÇECİ, BARIŞ (2019-01-01) Project scheduling is a common problem of today's companies, which have project type production system. Project scheduling is a mechanism to communicate what tasks need to get done and which organizational resources will be allocated to complete those tasks in what timeframe. In this study, it is aimed to find the shortest completion time of projects and the starting/ending time of each activity as well in a software company, which is running simultaneous projects including multiple activities with predeces...
DAILY OPERATION OF A MULTIPURPOSE RESERVOIR SYSTEM Yazıcıgil, Hasan; TOEBES, GERRIT H (1983-01-01) An optimization model that may be used by reservoir system operators to improve daily, real‐time operations and to evolve better long‐term operating guidelines is developed and tested. The four multipurpose reservoirs in the Green River Basin (GRB) of Kentucky are used as a case study. The GRB Operation Optimization Model (GRBOOM) is a linear program constructed to imitate the decision‐ making process that results in actual reservoir release decisions. The model is easily modifiable and very flexible, which...
LP relaxation-based solution algorithms for the multi-mode project scheduling with a non-renewable resource Azizoğlu, Meral; Pamir, Selin Kirbiyik (2015-01-01) In this study, we consider a multi-mode resource allocation problem with a single non-renewable resource. We assume the resource is released at defined time points and at defined quantities. We also assume that the activity costs are charged once they are completed. Our aim is to minimise the project completion time. We formulate the problem as a pure integer programming model and show that it is strongly NP-hard. We find lower bounds by pure and mixed integer linear programming relaxations of the model and...
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

M. Altun, R. Sönmez, and A. Akçamete Güngör, “Multi-Project Multi-Resource Leveling Using Mixed Integer Programming,” Lefkoşa, Kıbrıs, 2018, p. 1300, Accessed: 00, 2021. [Online]. Available: http://pcmc2018.ciu.edu.tr/index.php/ipcmc-2018-proceedings/.