Abstract
The problem arose in the context of devising a schedule for buses to be operated by a State Transport Corporation. An algorithm for obtaining a schedule to minimize the number of buses required is described, in which computational advantage is taken of the special structure of the problem. A computer program has been written and some results of its use are described.