Linear bottleneck assignment problem
id:
linear-bottleneck-assignment-problem-194-13992509
title:
Linear bottleneck assignment problem
text:
In combinatorial optimization, a field within mathematics, the linear bottleneck assignment problem (LBAP) is similar to the linear assignment problem. In plain words the problem is stated as follows: 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.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Linear_bottleneck_assignment_problem
date created:
date modified:
2023-11-26T16:13:27Z
main entity:
{"identifier":"Q6553416","url":"https://www.wikidata.org/entity/Q6553416"}
image:
fields total:
13
integrity:
13