Computation of Fair Crew Schedules in Regular Bus Transport

Day shifts of vehicles and corresponding drivers are closely associated in Slovak and Czech conditions. This means that such a running board of a bus can be serviced only with one or two subsequent drivers. Therefore running boards of vehicles are also driver shifts at the same time and that's why they have to comply to all safety rules required by law and also to Labour Code working conditions. However, it is necessary to follow other rules when creating schedules. One of them is a requirement for uniform workload for drivers. Too short shifts, long shifts with many and long waiting times and little driving could be very poorly paid and therefore dismissed by majority of drivers. If the schedules for the individual drivers were too different, some drivers would be too dissatisfied. We present here two algorithms for creating a bus schedule which is fair from the point of view of drivers. The problem of creating a schedule can be formulated by two ways - as a problem of bivalent linear programming, and as a problem discrete optimization based on manyfold combinations of heads and tails, resp. of bodies and fixed heads and tails of starting bus schedule.