A turnpike approach to solving the linear bottleneck assignment problem
 ChingChung Kuo,
 Gillian Nicholls
 … show all 2 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
The linear bottleneck assignment problem (LBAP), which is a variation of the classical assignment problem (CAP), seeks to minimize the longest completion time rather than the sum of the completion times when a number of jobs are to be assigned to the same number of workers. Several procedures have been proposed in the current literature to convert the LBAP into an equivalent CAP and then apply the Hungarian method to solve it efficiently. However, their applicability is limited because some of the elements in the transformed assignment matrix for the CAP can be too large to be handled by most computer programs. In this paper, we suggest a turnpike approach to alleviate the problem so that the conversion methodology will become more useful in practice. A numerical example is provided to demonstrate the superiority of the new algorithm to the existing ones.
 Aneja, YP, Punnen, AP (1999) Multiple bottleneck assignment problem. Eur J Oper Res 112: pp. 167173 CrossRef
 Armstrong, RD, Jin, J (1992) Solving linear bottleneck assignment problems via strong spanning trees. Oper Res Lett 12: pp. 179180 CrossRef
 Bhatia, HL (1977) Time minimizing assignment problem. Systems and Cybernetics in Management 6: pp. 7583
 Burkard, RE, Çela, E Linear assignment problems and extensions. In: Du, DZ, Pardalos, PM eds. (1999) Handbook of combinatorial optimization: supplement volume A. Kluwer, Dordrecht, pp. 75149 CrossRef
 Burkard, RE, Dell’Amico, M, Martello, S (2009) Assignment problems: revised reprint. Society for Industrial and Applied Mathematics, Philadelphia CrossRef
 Burkard, RE, Rendl, F (1991) Lexicographic bottleneck problems. Oper Res Lett 10: pp. 303308 CrossRef
 Burkard, RE, Rissner, R (2011) Polynomially solvable special cases of the quadratic bottleneck assignment problem. J Comb Optim 22: pp. 845856 CrossRef
 Burkard RE, Zimmermann U (1977) Weakly admissible transformations. Report No. 773, Köln, Germany: Mathematisches Institut, Universität zu Köln
 Carpaneto, G, Martello, S, Toth, P (1984) An algorithm for the bottleneck traveling salesman problem. Oper Res 32: pp. 380389 CrossRef
 Carpaneto, G, Toth, P (1981) Algorithm for the solution of the bottleneck assignment problem. Computing 27: pp. 179187 CrossRef
 Carraresi, P, Gallo, G (1984) A multilevel bottleneck assignment approach to the bus drivers’ rostering problem. Eur J Oper Res 16: pp. 163173 CrossRef
 De, P, Ghosh, JB, Wells, CE (1992) On the solution of a stochastic bottleneck assignment problem and its variations. Nav Res Logist 39: pp. 389397 CrossRef
 Derigs, U (1984) Alternate strategies for solving bottleneck assignment problems—analysis and computational results. Computing 33: pp. 95106 CrossRef
 Derigs, U, Zimmermann, U (1978) An augmenting path method for solving linear bottleneck assignment problems. Computing 19: pp. 285295 CrossRef
 Dokka, T, Kouvela, A, Spieksma, FCR (2012) Approximating the multilevel bottleneck assignment problem. Oper Res Lett 40: pp. 282286 CrossRef
 Edmonds, J, Fulkerson, DR (1970) Bottleneck extrema. Journal of Combinatorial Theory 8: pp. 299306 CrossRef
 Ford, LR, Fulkerson, DR (1962) Flows in networks. Princeton University Press, Princeton
 Fulkerson, DR, Glicksberg, I, Gross, O (1953). A production line assignment problem. Research Memorandum RM1102, Santa Monica, CA: Rand Corporation
 Garfinkel, RS (1971) An improved algorithm for the bottleneck assignment problem. Oper Res 19: pp. 17471751 CrossRef
 Garfinkel, RS, Gilbert, KC (1978) The bottleneck traveling salesman problem: algorithms and probabilistic analysis. J Assoc Comput Mach 25: pp. 435448 CrossRef
 Garfinkel, RS, Nemhauser, GL (1970) Optimal political districting by implicit enumeration techniques. Manag Sci 16: pp. 495508 CrossRef
 Gross, O (1959). The bottleneck assignment problem. Paper P1630, Santa Monica, CA: Rand Corporation
 Hammer, PL (1969) Timeminimizing transportation problems. Naval Research Logistics Quarterly 16: pp. 345357 CrossRef
 Kuhn, HW (1955) The Hungarian method for the assignment problem. Naval Research Logistics Quarterly 2: pp. 8397 CrossRef
 Kuo, CC (2011) Optimal assignment of resources to strengthen the weakest link in an uncertain environment. Ann Oper Res 186: pp. 159173 CrossRef
 Malhotra, R, Bhatia, HL, Puri, MC (1985) The three dimensional bottleneck assignment problem and its variants. Optimization 16: pp. 245256 CrossRef
 Mazzola, JB, Neebe, AW (1988) Bottleneck generalized assignment problems. Engineering Costs & Production Economics 14: pp. 6165 CrossRef
 Page, ES (1963) A note on assignment problems. Comput J 6: pp. 241243 CrossRef
 Papadimitriou, CH, Steiglitz, K (1982) Combinatorial optimization: algorithms and complexity. PrenticeHall, Englewood Cliffs
 Pentico, DW (2007) Assignment problems: a golden anniversary survey. Eur J Oper Res 176: pp. 774793 CrossRef
 Ravindran, A, Ramaswami, V (1977) On the bottleneck assignment problem. J Optim Theory Appl 21: pp. 451458 CrossRef
 Sokkalingam, PT, Aneja, YP (1998) Lexicographic bottleneck combinatorial problems. Oper Res Lett 23: pp. 2733 CrossRef
 Srinivasan, V, Thompson, GL (1976) Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems. Naval Research Logistics Quarterly 23: pp. 567595 CrossRef
 Szwarc, W (1971) Some remarks on the time transportation problem. Nav Res Logist 18: pp. 473485 CrossRef
 Trivedi, KS (2002) Probability and statistics with reliability, queuing and computer science applications. Wiley, New York
 Weiss, HJ, Gershon, ME (1993) Production and operations management. Allyn and Bacon, Needham Heights
 Yechiali, U (1968) A stochastic bottleneck assignment. Manag Sci 14: pp. 732734 CrossRef
 Title
 A turnpike approach to solving the linear bottleneck assignment problem
 Journal

The International Journal of Advanced Manufacturing Technology
Volume 71, Issue 58 , pp 10591068
 Cover Date
 20140301
 DOI
 10.1007/s0017001354641
 Print ISSN
 02683768
 Online ISSN
 14333015
 Publisher
 Springer London
 Additional Links
 Topics
 Keywords

 Assignment problem
 Hungarian method
 Linear bottleneck assignment problem
 Turnpike algorithm
 Industry Sectors
 Authors

 ChingChung Kuo ^{(1)}
 Gillian Nicholls ^{(2)}
 Author Affiliations

 1. Department of Management, College of Business, University of North Texas, 1155 Union Circle, #305429, Denton, TX, 762035017, USA
 2. Department of Industrial & Systems Engineering & Engineering Management, College of Engineering, The University of Alabama in Huntsville, N143 Technology Hall, Huntsville, AL, 35899, USA