AbstractThis paper is concerned with the classical vehicle scheduling problem where a set of vehicles with known capacities are to service a known set of points with deterministic demands at least cost. An extension of previous work is developed and an algorithm is presented. Suitable computational experience with the procedure is provided for both the symmetric and the non-symmetric problems.