A resource investment problem with time/resource trade-offs

Date

2014-05-01

Author

Colak, Erdem
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

162
views

0
downloads

In this study, we consider a Resource Investment Problem with time/resource trade-offs in project networks. We assume that there is a single renewable resource and the processing requirement of an activity can be reduced by investing extra resources. Our aim is to minimize the maximum resource usage, hence, the total amount invested for the single resource, while meeting the pre-specified deadline. We formulate the problem as a mixed integer linear model and find optimal solutions for small-sized problem instances. For large-sized problem instances, we propose a heuristic solution procedure. We develop several lower bounds and use them to evaluate the performance of our heuristic procedure. The results of our computational experiments have revealed the satisfactory behaviour of our optimality properties, lower bounds and heuristic procedure.

Subject Keywords

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

URI

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

Journal

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY

DOI

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

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems ÖZPEYNİRCİ, SELİN; Azizoğlu, Meral (Informa UK Limited, 2010-05-01) This study considers the operation assignment and capacity allocation problem in flexible manufacturing systems. A set of operations is selected to be processed and assigned to the machines together with their required tools. The purchase or usage of the required tools incurs a cost. The machines have scarce time and tool magazine capacities. The objective is to maximize the total weight of the assigned operations minus the total tooling costs. We use Lagrangean relaxation approach to obtain upper and lower...
A multicriteria sorting approach based on data envelopment analysis for R&D project selection problem Karasakal, Esra (Elsevier BV, 2017-12-01) In this paper, multiple criteria sorting methods based on data envelopment analysis (DEA) are developed to evaluate research and development (R&D) projects. The weight intervals of the criteria are obtained from Interval Analytic Hierarchy Process and employed as the assurance region constraints of models. Based on data envelopment analysis, two threshold estimation models, and five assignment models are developed for sorting. In addition to sorting, these models also provide ranking of the projects. The de...
Resource investment problem with time/resource trade-offs Çolak, Erdem; Azizoğlu, Meral; Department of Industrial Engineering (2011) In this study, we consider a resource investment problem with time/resource trade-offs in project environments. We assume each mode of an activity is characterized by its processing time and resource requirement and there is a single renewable resource. Our aim is to minimize the maximum resource usage, hence the total amount invested for the single resource. We formulate the problem as a mixed integer linear model and find optimal solutions for small sized problem instances. We propose several lower boundi...
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 ...
The multi-resource agent bottleneck generalised assignment problem Karsu, Ozlem; Azizoğlu, Meral (Informa UK Limited, 2012-01-01) In this study, we consider the multi resource agent bottleneck generalised assignment problem. Our aim is to minimise the maximum load over all agents. We take our motivation from an assignment problem faced in heating, ventilating and air conditioning sector. We study the linear programming (LP) relaxation of the problem. We use the optimal LP relaxation solutions in our branch and bound algorithm while defining bounding and branching schemes. We find that our branch and bound algorithm returns optimal sol...

Citation Formats

E. Colak and M. Azizoğlu, “A resource investment problem with time/resource trade-offs,” JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, pp. 777–790, 2014, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36459.