bottleneck assignment problem

bottleneck assignment problem

[′bäd·əl‚nek ə′sīn·mənt ‚präb·ləm]
(industrial engineering)
A linear programming problem in which it is required to assign machines to jobs (or vice versa) so that the efficiency of the least efficient operation is maximized.