The paper discusses some rules for scheduling a bus system consisting of an intertown route linking a string of interchanges each of which is the center of a set of feeder routes. Some of these rules are straightforward. However, the problem of distributing the feeder bus departures and arrivals evenly over the available timeslots is solved using an interesting new result in combinatorial group theory. Many concrete numerical examples are given.