When transit companies need drivers' schedules that cover the timetable and respect the collective agreement constraints, they face the bus driver scheduling problem. We describe an approximation and an optimization algorithm for this problem, and test their performance on real-world instances.
|Place of Publication||Eindhoven|
|Publisher||Technische Universiteit Eindhoven|
|Number of pages||9|
|Publication status||Published - 1993|