Bottleneck assignment problems under categorization
type: Item
instance of: scholarly article
title: Bottleneck assignment problems under categorization
zbMATH Open document ID: 0616.90028
DOI: 10.1016/0305-0548(86)90060-2
author: Vijay Aggarwal
author: V. G. Tikekar
author: Lie-Fern Hsu
published in: Computers \& Operations Research
publication date: 1986-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 3999638
zbMATH Keywords: bottleneck grouped assignment problems
zbMATH Keywords: branch and bound algorithms
MaRDI profile type: Publication
full work available at URL: 0305-0548(86)90060-2
OpenAlex ID: W2073713739
cites work: Q4130999
cites work: The alternating basis algorithm for assignment problems
cites work: A new algorithm for the assignment problem
cites work: Solving the Assignment Problem by Relaxation
cites work: The assignment problem with three job categories
cites work: The assignment problem under categorized jobs
cites work: Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
cites work: On the bottleneck assignment problem
cites work: Some Generalisations of the Time Minimising Assignment Problem
Recommended article: On bottleneck assignment problems under categorization.
Recommended article: The bottleneck generalized assignment problem
Recommended article: Multiple bottleneck assignment problem
Recommended article: Approximating the multi-level bottleneck assignment problem
Recommended article: Approximating the Multi-level Bottleneck Assignment Problem
Recommended article: An algorithm for the bottleneck generalized assignment problem
Recommended article: The random linear bottleneck assignment problem
Recommended article: A note on the complexity of the bilevel bottleneck assignment problem
Recommended article: Q4240872
description: scientific article; zbMATH DE number 3999638