Algorithms and Model Formulations in Mathematical Programming pp 170–171 Cite as
Procedures for Solving Bottleneck Generalized Assignment Problems
- Alan W. Neebe 2 &
- Joseph B. Mazzola 3
- Conference paper
237 Accesses
Part of the NATO ASI Series book series (NATO ASI F,volume 51)
We discuss bottleneck (or minimax) versions of the generalized assignment problem. The basic problem involves the assignment of a number of jobs to a number of agents such that each job is performed by a unique agent, and capacity limitations on the agents are not exceeded. Two versions of the bottleneck generalized problem (BGAP) are defined. The first of these is called the Task BGAP and has as its objective the minimization of the maximum of the costs of the assignments that are made. The second version is referred to as the Agent BGAP and has as its objective the minimization of the maximum of the total costs assigned to each agent.
- Private Sector
- Public Sector
- Model Formulation
- Mathematical Program
- Capacity Limitation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution .
Buying options
- Available as PDF
- Read on any device
- Instant download
- Own it forever
- Compact, lightweight edition
- Dispatched in 3 to 5 business days
- Free shipping worldwide - see info
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and affiliations.
School of Business Administration, University of North Carolina, USA
Alan W. Neebe
Fuqua School of Business, Duke University, USA
Joseph B. Mazzola
You can also search for this author in PubMed Google Scholar
Editor information
Editors and affiliations.
Chr. Michelsen Institute, Fantoftvegen 38, N-5036, Fantoft, Norway
Stein W. Wallace
Rights and permissions
Reprints and Permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper.
Neebe, A.W., Mazzola, J.B. (1989). Procedures for Solving Bottleneck Generalized Assignment Problems. In: Wallace, S.W. (eds) Algorithms and Model Formulations in Mathematical Programming. NATO ASI Series, vol 51. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83724-1_24
Download citation
DOI : https://doi.org/10.1007/978-3-642-83724-1_24
Publisher Name : Springer, Berlin, Heidelberg
Print ISBN : 978-3-642-83726-5
Online ISBN : 978-3-642-83724-1
eBook Packages : Springer Book Archive
Share this paper
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative
- Find a journal
- Publish with us
IMAGES
VIDEO
COMMENTS
We consider two versions of bottleneck (or min–max) generalized assignment problem (BGAP) under capacity uncertainty: Task–BGAP and Agent– A robust optimization solution to bottleneck generalized assignment problem under uncertainty | SpringerLink
Bottleneck Generalized Assignment Problem. Bottleneck generalized assignment problem (BGAP), is the min-max version of the well-known (min-sum) generalized assignment problem. In the BGAP, the maximum penalty incurred by assigning each task to an agent is minimized.
We discuss bottleneck (or minimax) versions of the generalized assignment problem. The basic problem involves the assignment of a number of jobs to a number of agents such that each job is performed by a unique agent, and capacity limitations on the agents are not...
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.
The min-max version of the generalized assignment problem is considered. We introduce relaxations and show that they produce, as sub-problems, min-max versions of the multiple-choice knapsack problem and of the 0–1 knapsack problem.
An assignment problem arises when there exists a set of tasks that must be allocated to a set of agents. The bottleneck assignment problem (BAP) has the objective of minimising the most costly allocation of a task to an agent.
We discuss bottleneck (or minimax) versions of the generalized assignment problem. The basic problem involves the assignment of a number of jobs to a number of agents such that each job is performed by a unique agent, and capacity limitations on the agents are not exceeded.
We discuss a bottleneck (or minimax) version of the generalized assignment problem, known as the task bottleneck generalized assignment problem (TBGAP). TBGAP involves the assignment of a number of jobs to a number of agents such that each job is performed by a unique agent, and capacity limitations on the agents are not exceeded.