In this thesis, we consider a discrete time/cost trade-off problem with a single nonrenewable resource. We assume the resource is released at some prespecified time points and at some prespecified quantities. We also assume that the costs due to the activities are incurred at their completions. Our aim is to minimize total project completion time.
We formulate the problem as a pure integer programming model. We show that the problem is strongly NP-hard. We find lower bounds by pure linear programming and mixed integer linear programming relaxations of the model. We develop three
heuristic procedures using the optimal solutions of mixed integer linear program and pure linear program.
The results of our computational study reveal the satisfactory performance of our heuristic procedures.
| Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/3/12611264/index.pdf |
| Date | 01 November 2009 |
| Creators | Kirbiyik, Selin |
| Contributors | Azizoglu - Cetinkaya, Meral - Ferda Can |
| Publisher | METU |
| Source Sets | Middle East Technical Univ. |
| Language | English |
| Detected Language | English |
| Type | M.S. Thesis |
| Format | text/pdf |
| Rights | Access forbidden for 1 year |
Page generated in 0.0017 seconds