Bottleneck assignment problems under categorization (Q1821678): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 04:48, 5 March 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
    0 references
    0 references
    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

    Identifiers