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
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 .
- 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
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
Editors and affiliations.
Chr. Michelsen Institute, Fantoftvegen 38, N-5036, Fantoft, Norway
Stein W. Wallace
Rights and permissions
Reprints and Permissions
© 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
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