A multi-level bottleneck assignment approach to the bus drivers ' rostering problem

@inproceedings{Carraresi2003AMB,
  title={A multi-level bottleneck assignment approach to the bus drivers ' rostering problem},
  author={Paolo Carraresi and Giovanni Gallo},
  year={2003}
}
The problem of finding a work assignment for drivers in a given time horizon, in such a way as to have an even distribution of the workload, is considered. This problem is formulated as a Multi-level Bottleneck Assignment Problem (MBA). The MBA problem is studied: it is shown that it is NP-complete and an asymptotically optimal algorithm is presented. Some computational results are illustrated which prove the efficiency of the algorithm. 
24 Citations
2 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Combinatorial Optiml=atton. Networks and Mutrolds

  • E. L. Lawler
  • 1976
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…