Swersey, Arthur J.; Ballard, Wilson - In: Management Science 30 (1984) 7, pp. 844-853
In the scheduling situation considered here, we are given a set of routes, each associated with a particular school. A single bus is assigned to each route, picking up the students and arriving at their school within a specified time window. The scheduling problem is to find the fewest buses...