Bottleneck assignment problems under categorization (Q1821678)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bottleneck assignment problems under categorization |
scientific article; zbMATH DE number 3999638
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bottleneck assignment problems under categorization |
scientific article; zbMATH DE number 3999638 |
Statements
Bottleneck assignment problems under categorization (English)
0 references
1986
0 references
This paper considers two special cases of bottleneck grouped assignment problems when n jobs belong to m distinct categories \((m<n)\). Solving these special problems through the available branch and bound algorithms will result in a heavy computational burden. Sequentially identifying nonoptimal variables, this paper provides more efficient methods for those cases. Propositions leading to the algorithms have been established. Numerical examples illustrate the respective algorithms.
0 references
bottleneck grouped assignment problems
0 references
branch and bound algorithms
0 references
0.9776891
0 references
0.92095417
0 references
0.90342456
0 references
0.9005827
0 references
0.9005827
0 references
0.8928043
0 references
0.8798678
0 references
0.8798678
0 references
0.87953526
0 references
