Bottleneck assignment problems under categorization
From MaRDI portal
Publication:1821678
DOI10.1016/0305-0548(86)90060-2zbMath0616.90028OpenAlexW2073713739MaRDI QIDQ1821678
Vijay Aggarwal, V. G. Tikekar, Lie-Fern Hsu
Publication date: 1986
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(86)90060-2
Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)
Related Items (17)
BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM ⋮ Categorized bottleneck-minisum path problems on networks ⋮ Assignment problems: a golden anniversary survey ⋮ Bilevel time minimizing assignment problem ⋮ Group centre and group median of a network ⋮ Minmax combinatorial optimization ⋮ Task preference-based bottleneck assignment problem ⋮ An improved algorithm for two stage time minimization assignment problem ⋮ Generalized Bottleneck Problems∗ ⋮ On bottleneck assignment problems under categorization. ⋮ A lexi-search algorithm for a time minimizing assignment problem. ⋮ Traveling salesman problem under categorization ⋮ Minimum perfect bipartite matchings and spanning trees under categorization ⋮ A survey of very large-scale neighborhood search techniques ⋮ Multiple bottleneck assignment problem ⋮ A priority based unbalanced time minimization assignment problem ⋮ A variant of time minimizing assignment problem
Cites Work
- Unnamed Item
- The assignment problem under categorized jobs
- On the bottleneck assignment problem
- Solving the Assignment Problem by Relaxation
- A new algorithm for the assignment problem
- Some Generalisations of the Time Minimising Assignment Problem
- The alternating basis algorithm for assignment problems
- The assignment problem with three job categories
- Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
This page was built for publication: Bottleneck assignment problems under categorization
