The Multilevel Bottleneck Assignment Problem is defined on a weighted graph of L levels and consists in finding Formula Not Shown complete matchings between contiguous levels, such that the heaviest path formed by the arcs in the matchings has a minimum weight. The problem, introduced by Carraresi and Gallo (1984) to model the rostering of bus drivers in order to achieve an even balance of the workload among the workers, though frequently cited, seems to have never been applied or extended to more general cases. In this paper, we discuss one possible extension, that is the introduction of multicommodity aspects to model different classes of workers.
|Titolo:||The multicommodity multilevel bottleneck assignment problem|
|Autori interni:||ARINGHIERI, ROBERTO (Primo)|
CORDONE, ROBERTO (Ultimo)
|Parole Chiave:||Bottleneck Assignment; Crew Rostering|
|Settore Scientifico Disciplinare:||Settore INF/01 - Informatica|
|Data di pubblicazione:||mag-2004|
|Digital Object Identifier (DOI):||10.1016/j.endm.2004.03.010|
|Appare nelle tipologie:||01 - Articolo su periodico|
File in questo prodotto:
- PubMed Central loading...