Approximating the multi-level bottleneck assignment problem

Authors:
Trivikram Dokka;Anastasia Kouvela;Frits C. R. Spieksma
Affiliations:
ORSTAT, K.U.Leuven, Leuven, Belgium;Management Science Group, London School of Economics, UK;ORSTAT, K.U.Leuven, Leuven, Belgium
Venue:
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Year:
2012

Citing 5
Cited 0

Scheduling with incompatible jobs

Discrete Applied Mathematics
Approximation algorithms for multi-index transportation problems with decomposable costs

GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
A New Efficiently Solvable Special Case of the Three-Dimensional Axial Bottleneck Assignment Problem

Selected papers from the 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics and Computer Science
A Multicommodity Flow Approach to the Crew Rostering Problem

Operations Research
Assignment Problems

Assignment Problems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the multi-level bottleneck assignment problem (MBA). This problem is described in the recent book "Assignment Problems" by Burkard et al. (2009) on pages 188 - 189. One of the applications described there concerns bus driver scheduling. We view the problem as a special case of a bottleneck m-dimensional multi-index assignment problem. We give approximation algorithms and inapproximability results, depending upon the completeness of the underlying graph.