Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A Multi-mode project scheduling problem with a single nonrenewable resource
Download
index.pdf
Date
2017
Author
Altıntaş, Cansu
Metadata
Show full item record
Item Usage Stats
187
views
94
downloads
Cite This
In this thesis, we consider a multi-mode project scheduling problem with a single nonrenewable resource. We assume that the resource is released in pre-specified times at pre-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 develop a mixed integer linear model and present a branch and bound algorithm. The results of our experiments have revealed that the mathematical model can handle only small-sized problem instances with up to 20 tasks and branch and bound algorithm can solve problem instances with up to 100 tasks for some resource release profiles.
Subject Keywords
Project management.
,
Branch and bound algorithms.
URI
http://etd.lib.metu.edu.tr/upload/12621214/index.pdf
https://hdl.handle.net/11511/26632
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
A Branch and Bound Algorithm for a Multi-Mode Project Scheduling Problem With a Single Non-Renewable Resource
Altıntaş, Cansu; Azizoğlu, Meral (2020-04-01)
In this paper, a project scheduling problem with multi-modes and a single non-renewable resource is considered. The resource is released in pre-specified times at pre-specified quantities. An activity can be executed at different modes where a mode is defined by a processing time and a resource requirement amount. The objective is to minimize the project completion time. A branch and bound algorithm that enumerates the partial solutions based on the mode assignment decisions is presented. The results of the...
A Resource Constrained Project Scheduling Problem With Multi-Modes
Altintas, Cansu; Azizoğlu, Meral (2020-01-01)
In this study, the authors consider a project scheduling problem with a single non-renewable resource. The authors assume that the resource is released at scheduled times and specified quantities and the resource is consumed at activity completion. The activities can be processed at different modes where a mode is defined by a processing time and a resource requirement amount. The problem is to select the modes and timings of the activities so as to minimize the project completion time. The authors give a m...
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...
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...
Optimization of Multireservoir Systems by Genetic Algorithm
Hinçal, Onur; Altan Sakarya, Ayşe Burcu; Ger, A. Metin (2011-03-01)
Application of optimization techniques for determining the optimal operating policy of reservoirs is a major issue in water resources planning and management. As an optimization Genetic Algorithm, ruled by evolution techniques, have become popular in diversified fields of science. The main aim of this study is to explore the efficiency and effectiveness of genetic algorithm in optimization of multi-reservoirs. A computer code has been constructed for this purpose and verified by means of a reference problem...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
C. Altıntaş, “A Multi-mode project scheduling problem with a single nonrenewable resource,” M.S. - Master of Science, Middle East Technical University, 2017.
