Integer linear programming approach to scheduling toll booth collectors problem

Abstract

A general daily staff scheduling problem with hourly requirement patterns is considered and formulated into an integer linear programming problem. A numerical illustrative example of scheduling toll booth collectors of full-timers and part-timers is presented and solved by LINDO.