DISCRETE TIME/COST TRADE-OFF PROJECT SCHEDULING PROBLEM - AN APPLICATION TO THE MINISTRY OF HEALTH PROJECTS

Download

10461223.pdf

Date

2022-4

Author

Akbudak, Özlem

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

394
views

190
downloads

The Discrete Time/Cost Trade-off (DTCT) problem is a widely studied and important research area in project scheduling literature. Decision-makers try to select the best schedule alternative when there are two or more conflicting criteria. So-called Time/Cost Trade-off problems represent the two conflicting criteria generalized as time and cost. Decreasing the processing time of a task requires more resources which demand additional cost. This study focuses on the DTCT problems where some of the tasks have due dates. If a completion time of a task exceeds the due date of a task, we face tardiness. We aim to find the best solution in terms of cost, with the total tardiness not exceeding the maximum allowable total tardiness level. We take our motivation from the two Information Technology projects that were most recently undertaken in the Ministry of Health. We construct a mixed integer linear programming model for this well-defined problem. Additionally, we propose a heuristic approach, which makes use of the optimal solutions of the Linear Programming Relaxation of the model. We tested the performance of the mathematical model and heuristic approach on several instances taken from the literature and on the two Ministry of Health projects, and report favorable results. Besides, one of the well-known Evolutionary Algorithm is applied to generate all non-dominated objective vectors with respect to the total cost and total tardiness criteria. We illustrate the algorithm on the two Ministry of Health projects.

Subject Keywords

Project scheduling, Discrete time/cost trade-off problem, Tardiness, Mathematical model, Heuristic approach

URI

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

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Discrete particle swarm optimization method for the large-scale discrete time-cost trade-off problem Aminbakhsh, Saman; Sönmez, Rifat (2016-06-01) Despite many research studies have concentrated on designing heuristic and meta-heuristic methods for the discrete time-cost trade-off problem (DTCTP), very little success has been achieved in solving large-scale instances. This paper presents a discrete particle swarm optimization (DPSO) to achieve an effective method for the large-scale DTCTP. The proposed DPSO is based on the novel principles for representation, initialization and position-updating of the particles, and brings several benefits for solvin...
Pareto oriented optimization of discrete time cost trade off problem using particle swarm optimization Aminbakhsh, Saman; Sönmez, Rifat (2015-09-07) In project scheduling, it is feasible to reduce the duration of a project by allocating additional resources to its activities. However, crashing the project schedule will impose additional costs. Numerous research has focused on optimizing the trade-off between time and cost to achieve a set of non-dominated solutions. However, the majority of the research on time-cost trade-off problem developed methods for relatively simple problems including up to eighteen activities, which are not representing the comp...
Delay Risk Assessment of Repetitive Construction Projects Using Line-of-Balance Scheduling and Monte Carlo Simulation Tokdemir, Onur Behzat; Dikmen Toker, İrem (American Society of Civil Engineers (ASCE), 2019-02-01) Although the line-of-balance (LOB) method is widely used for the scheduling of repetitive construction projects, there are only a limited number of studies that deal with the issue of how to incorporate uncertainty in repetitive schedules. In this paper, a delay risk assessment method is proposed for projects scheduled by LOB. In the proposed method, a LOB schedule is prepared considering the target rate of delivery, and then risk scenarios are defined considering the sources of uncertainty and vulnerabilit...
Pareto Front Particle Swarm Optimizer for Discrete Time-Cost Trade-Off Problem Aminbakhsh, Saman; Sönmez, Rifat (2017-01-01) Intensive heuristic and metaheuristic research efforts have focused on the Pareto front optimization of discrete time-cost trade-off problem (DTCTP). However, very little success has been achieved in solving the problem for medium and large-scale projects. This paper presents a new particle swarm optimization method to achieve an advancement in the Pareto front optimization of medium and large-scale construction projects. The proposed Pareto front particle swarm optimizer (PFPSO) is based on a multiobjectiv...
Scheduling a batch processing machine with incompatible job families Azizoğlu, Meral (2001-04-01) The problem of scheduling batch processors is important in some industries and, at a more fundamental level, captures an element of complexity common to many practical scheduling problems. We describe a branch and bound procedure applicable to a batch processor model with incompatible job families. Jobs in a given family have identical job processing times, arbitrary job weights, and arbitrary job sizes. Batches are limited to jobs from the same family. The scheduling objective is to minimize total weighted...

Citation Formats

Ö. Akbudak, “DISCRETE TIME/COST TRADE-OFF PROJECT SCHEDULING PROBLEM - AN APPLICATION TO THE MINISTRY OF HEALTH PROJECTS,” M.S. - Master of Science, Middle East Technical University, 2022.