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.
The multicommodity multilevel bottleneck assignment problem / R. Aringhieri, R. Cordone. - In: ELECTRONIC NOTES IN DISCRETE MATHEMATICS. - ISSN 1571-0653. - 17:(2004 May), pp. 35-40. ((Intervento presentato al 3. convegno CTW'04 (Cologne Twente Workshop on Graphs and Combinatorial Optimization) tenutosi a Menaggio, Italy nel 2004 [10.1016/j.endm.2004.03.010].
The multicommodity multilevel bottleneck assignment problem
R. AringhieriPrimo
;R. CordoneUltimo
2004
Abstract
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.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
