Scheduling of Toll Collectors

Publisher Website
Google Scholar
Abstract
The problem of rostering toll collectors for a toll facility such as a bridge, tunnel, or expressway is formulated as an integer program. The working regulations for full-time and part-time shifts give special structure to the program. An eight phase algorithm is described that exploits this special structure and enables variables to be grouped together and the integer constraints successively introduced. The algorithm has been tested for a wide variety of practical schedule problems and has proved successful in obtaining acceptable schedules in comparatively short computer run times.

This publication has 0 references indexed in Scilit: