| Abstract: | A branch and bound algorithm is presented for determining the minimum number of telephone operators, and their shift schedules, required to meet demand that varies over a 24 hour operating period. An integer linear programming formulation is used, and the algorithm is described in terms of its separation, relaxation, fathoming, and branching procedures. Computational results are provided, using actual operating data. The results indicate that practical sized problems can be solved by the algorithm, involving as many as 100 different shift type variables and demand profiles typical of those encountered in many telephone traffic exchanges. |
