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
Discrete time/cost trade-off problem in project scheduling
Download
index.pdf
Date
2007
Author
Hafızoğlu, Ahmet Baykal
Metadata
Show full item record
Item Usage Stats
288
views
96
downloads
Cite This
In project scheduling, the activity durations can often be reduced by dedicating additional resources. Time/Cost Trade-off Problem considers the compromise between the total cost and project duration. The discrete version of the problem assumes a number of time/cost pairs, so called modes, and selects a mode for each activity. In this thesis we consider the Discrete Time/Cost Trade-off Problem. We first study the Deadline Problem, i.e., the problem of minimizing total cost subject to a deadline on project duration. To solve the Deadline Problem, we propose several optimization and approximation algorithms that are based on optimal Linear Programming Relaxation solutions. We then analyze the problem of generating all efficient solutions, and propose an approach that uses the successive solutions of the Deadline Problem. Our computational results on large-sized problem instances have revealed the satisfactory behavior of our algorithms.
Subject Keywords
Systems Engineering.
URI
http://etd.lib.metu.edu.tr/upload/12608469/index.pdf
https://hdl.handle.net/11511/16924
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Linear programming based approaches for the discrete time/cost trade-off problem in project networks
Hafizoglu, A. B.; Azizoğlu, Meral (Informa UK Limited, 2010-04-01)
In project management, the activity durations can often be reduced by dedicating additional resources. The Time/Cost Trade-off Problem considers the compromise between the total cost and the project duration. The discrete version of the problem assumes a number of time/cost pairs, called modes, and selects a mode for each activity. In this paper, we consider the Discrete Time/Cost Trade-off Problem. We study the Deadline Problem, that is, the problem of minimizing total cost subject to a deadline on the pro...
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...
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...
A genetic algorithm for the location-routing problem with time windows
Özgönenç, Hande; Meral, Fatma Sedef; Department of Industrial Engineering (2006)
The emphasis on minimizing the logistics costs to decrease overall system costs has led the researchers to consider the interdependencies between the decisions of locating facilities and planning the routes from those facilities. The location-routing problems considering this issue are the subject of this thesis study. A two-level hierarchical distribution system is considered in which goods are delivered from the sources (plants) to the facilities (depots) and then from the facilities to the customers. The...
Energy conscious scheduling of a material handling robot in a manufacturing cell
Gürel, Sinan; Akhlaghi, Vahid Eghbal (Elsevier BV, 2019-08-01)
In cyclic scheduling of material handling robots in manufacturing cells, a common approach is to minimize the cycle time objective, which is a measure of the throughput of the cell. In a typical robot move cycle, robot move times constitute a significant portion of the cycle time. During handling operations, robots consume significant amount of energy, which is determined by their speed, load and the distance they travel. In this paper, we propose considering robot speed decisions along with robot move sequ...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. B. Hafızoğlu, “Discrete time/cost trade-off problem in project scheduling,” M.S. - Master of Science, Middle East Technical University, 2007.
