Approximating the multi-level bottleneck assignment problem

DOI10.1016/J.ORL.2012.04.003zbMATH Open1247.90172OpenAlexW4248190034MaRDI QIDQ453052FDOQ453052

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 complexityapproximationefficient algorithmbottleneck problemmultidimensional assignment

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (13)

• A note on exact algorithms for the bottleneck generalized assignment problem
• The Multicommodity Multilevel Bottleneck Assignment Problem
• A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness
• Title not available (Why is that?)
• Solution methods and computational investigations for the linear bottleneck assignment problem
• Multi-dimensional vector assignment problems
• Bottleneck assignment problems under categorization
• Title not available (Why is that?)
• Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations
• Makespan minimization on unrelated parallel machines with a few bags
• Task preference-based bottleneck assignment problem
• Dynamic discrete tomography
• On minimizing the makespan when some jobs cannot be assigned on the same machine

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)