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
Multi resource agent bottleneck generalized assignment problem
Download
index.pdf
Date
2010
Author
Karabulut, Özlem
Metadata
Show full item record
Item Usage Stats
149
views
67
downloads
Cite This
In this thesis, we consider the Multi Resource Agent Bottleneck Generalized Assignment Problem. We aim to minimize the maximum load over all agents. 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 lower and upper bounds and branching schemes. We find that our Branch and Bound algorithm returns optimal solutions to the problems with up to 60 jobs when the number of agents is 5, and up to 30 jobs when the number of agents is 10, in less than 20 minutes. To find approximate solutions, we define a tabu search algorithm and an α approximation algorithm. Our computational results have revealed that these procedures can find high quality solutions to large sized instances very quickly.
Subject Keywords
Industrial engineering.
,
Multi periods.
URI
http://etd.lib.metu.edu.tr/upload/3/12611790/index.pdf
https://hdl.handle.net/11511/19497
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
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...
Discrete time/cost trade-off project scheduling with a nonrenewable resource
Kırbıyık, Selin; Azizoğlu, Meral; Çetinkaya, Ferda Can; Department of Industrial Engineering (2009)
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 mi...
Multi-objective decision making using fuzzy discrete event systems: A mobile robot example
Boutalis, Yiannis; Schmidt, Klaus Verner (2010-09-29)
In this paper, we propose an approach for the multi-objective control of sampled data systems that can be modeled as fuzzy discrete event systems (FDES). In our work, the choice of a fuzzy system representation is justified by the assumption of a controller realization that depends on various potentially imprecise sensor measurements. Our approach consists of three basic steps that are performed in each sampling instant. First, the current fuzzy state of the system is determined by a sensor evaluation. Seco...
Comparison of the resource allocation cababilities of project management software packages in resource constrained project scheduling problems
Hekimoğlu, Özge; Serpil, Canan; Department of Industrial Engineering (2007)
In this study, results of a comparison on benchmark test problems are presented to investigate the performance of Primavera V.4.1 with its two resource allocation priority rules and MS Project 2003. Resource allocation capabilities of the packages are measured in terms of deviation from the upper bound of the minimum makespan. Resource constrained project scheduling problem instances are taken from PSPLIB which are generated under a factorial design from ProGen. Statistical tests are applied to the results ...
Disassembly line balancing problem with fixed number of workstations and finite supply
Göksoy, Eda; Azizoğlu, Meral; Department of Industrial Engineering (2010)
In this thesis, we consider a Disassembly Line Balancing Problem (DLBP) with fixed number of workstations. We aim to maximize the total value of the recovered parts. We assume that there is a limited supply for the products to be disassembled. Different components can be obtained by disassembling different units of the product. Our aim is to assign the tasks to the workstations of the disassembly line so as to maximize the total value of the recovered parts. We present several upper and one lower bounding p...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
Ö. Karabulut, “Multi resource agent bottleneck generalized assignment problem,” M.S. - Master of Science, Middle East Technical University, 2010.