“Linear bottleneck assignment problem”的意思、由来-开放百科全书

词条

Linear bottleneck assignment problem

释义

Formal definition
Mathematical programming formulation
Asymptotics
References

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.

Formal definition

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:

is minimized.

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

Mathematical programming formulation

subject to:

Asymptotics

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

and

References

1. ^Assignment Problems, by Rainer Burkard, Mauro Dell'Amico, Silvano Martello, 2009, Chapter 6.2 "[https://books.google.com/books?id=nHIzbApLOr0C&pg=PA198&dq=%22bottleneck+assignment+problem%22&hl=en&ei=A7f0S9DjMYH6sQOYt8CIBQ&sa=X&oi=book_result&ct=result&resnum=2&ved=0CDIQ6AEwAQ#v=onepage&q=%22bottleneck%20assignment%20problem%22&f=false Linear Bottleneck Assignment Problem]" (p. 172)
2. ^Michael Z. Spivey, "Asymptotic Moments of the Bottleneck Assignment Problem," Mathematics of Operations Research, 36 (2): 205-226, 2011.

1 : Combinatorial optimization

随便看

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。