A turnpike approach to solving the linear bottleneck assignment problem.

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. [ABSTRACT FROM AUTHOR]