Resource investment problem with time/resource trade-offs

Download

index.pdf

Date

2011

Author

Çolak, Erdem

Metadata

Show full item record

Item Usage Stats

170
views

124
downloads

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 bounding procedures to find high quality estimates on the optimal resource investment cost. We use our lower bounds to evaluate the performance of our heuristic procedures. The results of our computational experiments have revealed the satisfactory performances of our lower bounds and heuristic procedures. Projects, Resource Investment Time/Resource Trade-off, Bounding Procedures

Subject Keywords

Production control., Project management.

URI

http://etd.lib.metu.edu.tr/upload/12613376/index.pdf
https://hdl.handle.net/11511/20591

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

A resource investment problem with time/resource trade-offs Colak, Erdem; Azizoğlu, Meral (Informa UK Limited, 2014-05-01) 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 in...
LP relaxation-based solution algorithms for the multi-mode project scheduling with a non-renewable resource Azizoğlu, Meral; Pamir, Selin Kirbiyik (2015-01-01) In this study, we consider a multi-mode resource allocation problem with a single non-renewable resource. We assume the resource is released at defined time points and at defined quantities. We also assume that the activity costs are charged once they are completed. Our aim is to minimise the project completion time. We formulate the problem as a pure integer programming model and show that it is strongly NP-hard. We find lower bounds by pure and mixed integer linear programming relaxations of the model and...
Multi-Mode Resource Constrained Project Scheduling Problem With a Single Nonrenewable Resource Altıntaş, Cansu; Azizoğlu, Meral (2016-10-06) In this study, we consider a project scheduling problem with a single nonrenewable resource. We assume that the resource is released in scheduled times at specified quantities and the resource is consumed at activity completions. The activities can be processed at different modes where a mode is defined by a processing time and a resource requirement amount. Our problem is to select the modes and timings of the activities so as to minimize the project completion time. We give an efficient mathematical formu...
Batch scheduling duling of incompatible jobs on a single reactor with dynamic arrivals Korkmaz, Gediz; Kayalıgil, Sinan; Department of Industrial Engineering (2004) In this study, a single machine batch-scheduling problem with incompatible jobs and dynamic arrivals is examined. The objective function is the minimization of the total flow time of the jobs. For solving problems a case specific branch and bound algorithm with a heuristic upper bound scheme and two alternative lower bound procedures is used. An extensive computational experiment is conducted to investigate the effects of certain parameters on the computation time. For the most difficult parameter combinati...
Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches ÖZPEYNİRCİ, SELİN; Azizoğlu, Meral (Informa UK Limited, 2009-01-01) This study considers an operation assignment and capacity allocation problem that arises in flexible manufacturing systems. The machines have limited time and tool magazine capacities and the available tools are limited. Our objective is to maximise total weight of assigned operations. We develop a branch and bound algorithm that finds the optimal solutions and a beam search algorithm that finds high quality solutions in polynomial time.

Citation Formats

E. Çolak, “Resource investment problem with time/resource trade-offs,” M.S. - Master of Science, Middle East Technical University, 2011.