Advanced SearchSearch Tips
An Linear Bottleneck Assignment Problem (LBAP) Algorithm Using the Improving Method of Solution for Linear Minsum Assignment Problem (LSAP)
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
An Linear Bottleneck Assignment Problem (LBAP) Algorithm Using the Improving Method of Solution for Linear Minsum Assignment Problem (LSAP)
Lee, Sang-Un;
  PDF(new window)
In this paper, we propose a simple linear bottleneck assignment problems (LBAP) algorithm to find the optimal solution. Generally, the LBAP has been solved by threshold or augmenting path algorithm. The primary characteristic of proposed algorithm is derived the optimal solution of LBAP from linear sum assignment problem (LSAP). Firstly, we obtains the solution for LSAP from the selected minimum cost of rows and moves the duplicated costs in row to unselected row with minimum increasing cost in direct and indirect paths. Then, we obtain the optimal solution of LBAP according to the maximum cost of LSAP can be move to less cost. For the 29 balanced and 7 unbalanced problem, this algorithm finds optimal solution as simple.
Threshold value;Bottleneck;Bottleneck assignment problem;Maxmin;Makespan;
 Cited by
개선된 한계 알고리즘을 적용한 선형병목할당문제,이상운;

한국정보기술학회논문지, 2016. vol.14. 2, pp.125-133 crossref(new window)
B. Rainer, M. Dell'Amico, and S. Martello, "Assignment Problems," pp. 73-144, SIAM, 2009.

H. W. Kuhn, "The Hungarian Method for the Assignment Problem," Naval Research Logistics Quarterly, Vol. 2, No. 1-2, pp. 83-97, Mar. 1955. crossref(new window)

L. Ntaimo, "Introduction to Mathematical Programming: Operations Research: Transportation and Assignment Problems," Vol. 1, 4th ed., Pacific Grove, CA : Thomson, 2005.

F. D. Croce, V. T. Paschos, and A. Tsoukias, "An Improved General Procedure for Lexigraphic Bottleneck Problems," Operations Research Letters, Vol. 24, No. 4, pp. 187-194, May 1999. crossref(new window)

H. W. Corley and H. Golnabi, "Technical Note: A Generalized Bottleneck Assignment Problem," Journal of Optimization Theory and Applications, Vol. 36, No. 1, pp. 135-138, Jan. 1982. crossref(new window)

R. Burkard, M. Dell'Amico, and S. Martello, "Linear Assignment Problems, Section 6.6 Lexicographic Bottleneck Assignment Problem," pp. 198-202, SIAM, 2008.

E. S. Page, "A Note on Assignment Problems," The Computer Journal, Vol. 6, No. 3, pp. 241-243, 1963. crossref(new window)

R. S. Garfinkel, "Technocal Note-An Improved Algorithm for the Bottleneck Assignment Problem," Operations Research, Vol. 19, No. 7, pp. 1747-1751, Nov. 1971. crossref(new window)

R. E. Burkard, "Optimierung und Kontrolle: Selected Topics on Assignment Problems," Karl-Franzens-Universitat Graz & Technische Universitat Graz, 1999.

U. Derigs, "Alternate Strategies for Solving Bottleneck Assignment Problems-Analysis and Computational Results," Computing, Vol. 33, No. 2, pp. 95-106, Jun. 1984. crossref(new window)

O. Gross, "The Bottleneck Assignment Problem," Report No. P-1620, The Rand Corporation, Santa Monica, California, 1959.

R. Fulkerson, I. Glickberg, and O. Gross, "A Production Line Assignment Problem," Technical Report RM-1102, The Rand Corporation, Santa Monica, California, 1953.

H. N. Gabow and R. E. Tarjan, "Algorithms for two Bottleneck Optimization Problems," Journal of Algorithms, Vol. 9, No. 3, pp. 411-417, Sep. 1988. crossref(new window)

U. Pfershy, "The Random Linear Bottleneck Assignment Problem," Integer Programming and Combinatorial Optimization, Proceedings of 4th International IPCO Conference, Lecture Notes in Computer Science, Vol. 920, pp. 145-156, May 1995.

K. Kinahan and J. Pryor, "Algorithm Animations for Practical Optimization: A Gentle Introduction,", 2007.

D. N. Kumar, "Optimization Methods,", IISc, Bangalore, 2008.

S. U. Lee, "Assignment Problem Algorithm Based on the First Selection Method of the Minimum Cost," Journal of IIBC, Vol. 13, No. 5, pp. 163-171, Oct. 2013.