Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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