A Heuristic for Resource-Constrained Multi-ProjectDiscrete Time-Cost Trade-Off Problem

Date

2018-11-16

Author

Seyisoğlu, Oya Başak
Sönmez, Rifat

Metadata

Show full item record

Item Usage Stats

182
views

0
downloads

Resource-constrained project scheduling in a multi-project environment is a challenging optimization problem as it requires simultaneous scheduling of activities associated with multiple projects, considering availability of scarce resources while satisfying a set of constraints. Despite a large number of researches being concentrated on developing heuristics and metaheuristics for the discrete time-cost trade-off scheduling problem, very few of the proposed methods analyze multiple projects adequately to reflect the real-world case. Existing studies related to multi-projects generally focus solely on project makespan optimization, which seeks to minimize the duration of projects. However, for optimal scheduling of multiple projects, in addition to project duration the direct and indirect costs should be considered as well. In order to fill this gap in the literature, this study aims to develop a heuristic algorithm for optimal scheduling of multiple projects considering project duration and cost along with the availability of resources.

URI

https://hdl.handle.net/11511/78933

Conference Name

5th International Project and Construction Management Conference, 2018

Collections

Department of Civil Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

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...
An architecture for workflow scheduling under resource allocation constraints Karagöz, Pınar; Toroslu, İsmail Hakkı (Elsevier BV, 2005-07-01) Research on specification and scheduling of workflows has concentrated on temporal and causality constraints, which specify existence and order dependencies among tasks. However, another set of constraints that specify resource allocation is also equally important. The resources in a workflow environment are agents such as person, machine, software, etc. that execute the task. Execution of a task has a cost and this may vary depending on the resources allocated in order to execute that task. Resource alloca...
A genetic algorithm for resource leveling of construction projects Iranagh, Mahdi Abbasi; Sönmez, Rifat (2012-01-01) 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 re...
A Method to decrease common problems in effort data collection in the software industry Özkaya Eren, Ayşegül; Demirörs, Onur; Department of Information Systems (2012) Efficient project planning and project management is crucial to complete the software projects in expected time and requirements. The most critical stage in project planning is estimation of the software size, time and budget. In this stage, effort data is used for benchmarking data sets, effort estimation, project monitoring and controlling. However, there are some problems related to effort data collection in the software industry. In this thesis, a pilot study and survey study are conducted to observe co...
The budget constrained discrete time/cost trade-off problem in project networks Değirmenci, Güvenç; Azizoğlu, Meral; Department of Industrial Engineering (2008) The time/cost trade-off models in project management aim to compress the project completion time by accelerating the activity durations at an expense of additional resources. The budget problem in discrete time/cost trade-off scheduling selects the time/cost mode -among the discrete set of specified modes- for each activity so as to minimize the project completion time without exceeding the available budget. There may be alternative modes that solve the budget problem optimally, however each solution may ha...

Citation Formats

O. B. Seyisoğlu and R. Sönmez, “A Heuristic for Resource-Constrained Multi-ProjectDiscrete Time-Cost Trade-Off Problem,” presented at the 5th International Project and Construction Management Conference, 2018, Cyprus, 2018, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/78933.