Approximating the multi-level bottleneck assignment problem

DOI10.1016/J.ORL.2012.04.003MaRDI QIDQ453052zbMATH OpenOpenAlexFDO

Authors Trivikram Dokka, Anastasia Kouvela, Frits C. R. Spieksma

Publication date 18 September 2012

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://lirias.kuleuven.be/handle/123456789/336714

zbMATH Keywords

computational complexityapproximationefficient algorithmbottleneck problemmultidimensional assignment

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• Approximating the multi-level bottleneck assignment problem
• The Multicommodity Multilevel Bottleneck Assignment Problem
• The approximability of three-dimensional assignment problems with bottleneck objective
• A multi-level bottleneck assignment approach to the bus drivers' rostering problem
• Multiple bottleneck assignment problem

Cites work

• A heuristic procedure for the crew rostering problem
• A multi-level bottleneck assignment approach to the bus drivers' rostering problem
• Approximation Algorithms for the Assembly Line Crew Scheduling Problem
• Approximation algorithms for multi-index transportation problems with decomposable costs
• Assignment Problems
• Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum
• Scheduling with incompatible jobs
• The Multicommodity Multilevel Bottleneck Assignment Problem

Cited in

(15)

• A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness
• Bottleneck assignment problems under categorization
• A note on exact algorithms for the bottleneck generalized assignment problem
• Multi-dimensional vector assignment problems
• Solution methods and computational investigations for the linear bottleneck assignment problem
• On minimizing the makespan when some jobs cannot be assigned on the same machine
• Dynamic discrete tomography
• scientific article; zbMATH DE number 5524189 (Why is no real title available?)
• Makespan minimization on unrelated parallel machines with a few bags
• Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations
• scientific article; zbMATH DE number 1688388 (Why is no real title available?)
• The Multicommodity Multilevel Bottleneck Assignment Problem
• The approximability of three-dimensional assignment problems with bottleneck objective
• Task preference-based bottleneck assignment problem
• Approximating the multi-level bottleneck assignment problem

This page was built for publication: Approximating the multi-level bottleneck assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q453052)