Approximating the multi-level bottleneck assignment problem

DOI10.1016/j.orl.2012.04.003zbMath1247.90172MaRDI QIDQ453052

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

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 complexity; approximation; bottleneck problem; efficient algorithm; multidimensional assignment

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

90B80: Discrete location and assignment

Related Items

Dynamic discrete tomography, On minimizing the makespan when some jobs cannot be assigned on the same machine, Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations, Makespan minimization on unrelated parallel machines with a few bags, Multi-dimensional vector assignment problems, Task preference-based bottleneck assignment problem

Cites Work

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