The Operator-Scheduling Problem: A Network-Flow Approach

Abstract

The number of telephone operators required on duty at switchboards fluctuates widely during the day. Work periods of operators are defined by start and end times of tours and by the timing of break and relief periods within tours. This paper proposes a method for determining the number of operators assigned to tours and their corresponding timing of breaks and reliefs; it relies on various network-flow formulations. An example application of the method is presented.