Linear bottleneck assignment problem

In combinatorial optimization, a field within mathematics, the linear bottleneck assignment problem (LBAP) is similar to the linear assignment problem.^[1]

In plain words the problem is stated as follows:

There are a number of agents and a number of tasks. Any agent can be assigned to perform any task, incurring some cost that may vary depending on the agent-task assignment. It is required to perform all tasks by assigning exactly one agent to each task in such a way that the maximum cost among the individual assignments is minimized.

The term "bottleneck" is explained by a common type of application of the problem, where the cost is the duration of the task performed by an agent. In this setting the "maximum cost" is "maximum duration", which is the bottleneck for the schedule of the overall job, to be minimized.

The formal definition of the bottleneck assignment problem is

Given two sets, A and T, together with a weight function C : A × T → R. Find a bijection f : A → T such that the cost function:

${\displaystyle \max _{a\in A}C(a,f(a))}$

is minimized.

Usually the weight function is viewed as a square real-valued matrix C, so that the cost function is written down as:

${\displaystyle \max _{a\in A}C_{a,f(a)}}$

${\displaystyle \min \,\max _{i,j}c_{ij}x_{ij}}$

subject to:

${\displaystyle \sum _{j=1}^{n}x_{ij}=1(i=1,2,\dots ,n),}$

${\displaystyle \sum _{i=1}^{n}x_{ij}=1(j=1,2,\dots ,n),}$

${\displaystyle x_{ij}\in \{0,1\}(i,j=1,2,\dots ,n)}$

Let ${\displaystyle c_{n}^{*}}$ denote the optimal objective function value for the problem with n agents and n tasks. If the costs ${\displaystyle c_{ij}}$ are sampled from the uniform distribution on (0,1), then^[2]

${\displaystyle E[c_{n}^{*}]={\frac {\log n+\log 2+\gamma }{n}}+O\left({\frac {(\log n)^{2}}{n^{7/5}}}\right)}$

and

${\displaystyle Var[c_{n}^{*}]={\frac {\zeta (2)-2(\log 2)^{2}}{n^{2}}}+O\left({\frac {(\log n)^{2}}{n^{7/3}}}\right).}$