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
| Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/12613376/index.pdf |
| Date | 01 July 2011 |
| Creators | Colak, Erdem |
| Contributors | Azizoglu, Meral |
| Publisher | METU |
| Source Sets | Middle East Technical Univ. |
| Language | English |
| Detected Language | English |
| Type | M.S. Thesis |
| Format | text/pdf |
| Rights | To liberate the content for public access |
Page generated in 0.0017 seconds