Linear programming based approaches for the discrete time/cost trade-off problem in project networks

Date

2010-04-01

Author

Hafizoglu, A. B.
Azizoğlu, Meral

Metadata

Show full item record

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

Item Usage Stats

208
views

0
downloads

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 project duration. To solve the Deadline Problem, we propose optimization and approximation algorithms that are based on the optimal Linear Programming Relaxation solutions. Our computational results from large-sized problem instances reveal the satisfactory behaviour of our algorithms. Journal of the Operational Research Society (2010) 61, 676-685. doi: 10.1057/jors.2009.20 Published online 25 March 2009

Subject Keywords

Marketing, Management Science and Operations Research, Strategy and Management, Management Information Systems

URI

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

Journal

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY

DOI

https://doi.org/10.1057/jors.2009.20

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Discrete time/cost trade-off problem in project scheduling Hafızoğlu, Ahmet Baykal; Azizoğlu, Meral; Department of Industrial Engineering (2007) 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 d...
Due date and cost-based FMS loading, scheduling and tool management Turkcan, Ayten; Akturk, M. Selim; Storer, Robert H. (Informa UK Limited, 2007-03-01) In this study, we consider flexible manufacturing system loading, scheduling and tool management problems simultaneously. Our aim is to determine relevant tool management decisions, which are machining conditions selection and tool allocation, and to load and schedule parts on non-identical parallel CNC machines. The dual objectives are minimization of the manufacturing cost and total weighted tardiness. The manufacturing cost is comprised of machining and tooling costs (which are affected by machining cond...
Hybrid Genetic Algorithm with Simulated Annealing for Resource-Constrained Project Scheduling BETTEMİR, ÖNDER HALİS; Sönmez, Rifat (American Society of Civil Engineers (ASCE), 2015-09-01) Resource-constrained project scheduling problem (RCPSP) is a very important optimization problem in construction project management. Despite the importance of the RCPSP in project scheduling and management, commercial project management software provides very limited capabilities for the RCPSP. In this paper, a hybrid strategy based on genetic algorithms, and simulated annealing is presented for the RCPSP. The strategy aims to integrate parallel search ability of genetic algorithms with fine tuning capabili...
Performance of the heuristic procedures for constrained projects with progress payments Sepil, C; Ortac, N (Informa UK Limited, 1997-11-01) All large scale resource constrained projects involve cash flows occurring during their life cycle. Several recent studies consider the problem of scheduling projects to maximise the net present value (NPV) of these cash flows. Their basic common assumption is that cash flows are mainly associated with specific events and they occur at event realisation times. An alternative assumption, which can be more realistic, is that cash inflows occur periodically, for example every month; as progress payments. This ...
JOB-SHOP SCHEDULING UNDER A NONRENEWABLE RESOURCE CONSTRAINT TOKER, A; KONDAKCI, S; ERKIP, N (JSTOR, 1994-08-01) In this paper we consider the job shop scheduling problem under a discrete non-renewable resource constraint. We assume that jobs have arbitrary processing times and resource requirements and there is a unit supply of the resource at each time period. We develop an approximation algorithm for this problem and empirically test its effectiveness in finding the minimum makespan schedules.

Citation Formats

A. B. Hafizoglu and M. Azizoğlu, “Linear programming based approaches for the discrete time/cost trade-off problem in project networks,” JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, pp. 676–685, 2010, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/47533.