Abstract
ABSTRACTA 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
