Abstract
In this paper, a new approach for solving the bottleneck assignment problem is presented. The problem is treated as a special class of permutation problems which we call max-min permutation problems. By defining a suitable neighborhood system in the space of permutations and designating certain permutations as critical solutions, it is shown that any critical solution yields a global optimum. This theorem is then used as a basis to develop a general method to solve max-min permutation problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Nicholson, T. A. J.,A Method for Optimizing Permutation Problems and its Industrial Applications, Combinatorial Mathematics and its Applications, Edited by D. J. A. Welsh, Academic Press, New York, New York, 1971.
Jacobson, N.,Lectures in Abstract Algebra, Vol. 1, D. Van Nostrand Company, New York, New York, 1951.
Charnes, A., andCooper, W. W.,The Stepping Stone Method of Explaining Linear Programming Calculations in Transportation Problems, Management Science, Vol. 1, pp. 49–69, 1954–55.
Ford, L. R., andFulkerson, D. R.,Flows in Networks, Princeton University Press, Princeton, New Jersey, 1962.
Author information
Authors and Affiliations
Additional information
Communicated by C. T. Leondes
This work was carried out by the junior author while holding a Purdue University Fellowship.
Rights and permissions
About this article
Cite this article
Ravindran, A., Ramaswami, V. On the bottleneck assignment problem. J Optim Theory Appl 21, 451–458 (1977). https://doi.org/10.1007/BF00933089
Issue Date:
DOI: https://doi.org/10.1007/BF00933089