Top Qs
Timeline
Chat
Perspective
Linear bottleneck assignment problem
From Wikipedia, the free encyclopedia
Remove ads
Remove ads
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.
Remove ads
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:
Remove ads
Mathematical programming formulation
Summarize
Perspective
subject to:
Remove ads
Asymptotics
Summarize
Perspective
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
Remove ads
References
Wikiwand - on
Seamless Wikipedia browsing. On steroids.
Remove ads