Bottleneck assignment problems under categorization (Q1821678): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:47, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bottleneck assignment problems under categorization |
scientific article |
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
