Article1977

DETERMINING OPTIMAL SHIFT SCHEDULES FOR TELEPHONE TRAFFIC EXCHANGE OPERATORS

41 citations0/0 files storedDecision Sciences

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Scheduling and Timetabling Solutions Healthcare Operations and Scheduling Optimization Optimization and Mathematical Programming

Abstract

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.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 41 citations exist upstream.

References

1971The Location of Emergency Service Facilities 1954Traffic Delays at Toll Booths 1974The Operator-Scheduling Problem: A Network-Flow Approach 1976Heuristic Methods for Telephone Operator Shift Scheduling: An Experimental Analysis 1974Scheduling a Full-Time Workforce to Meet Cyclic Staffing Requirements 1972Optimal Scheduiing of Two Consecutive Idle Periods 1968Rotating Roster for a Transit System

Cited by

1988IMPLICIT OPTIMAL AND HEURISTIC LABOR STAFFING IN A MULTIOBJECTIVE, MULTILOCATION ENVIRONMENT*1993Labor Utilization Effects of Labor Scheduling Flexibility Alternatives in a Tour Scheduling Environment 1978One- and two-phase heuristics for workforce scheduling 2006Scheduling workforce relief breaks in advance versus in real-time 1994Working set generation methods for labor tour scheduling 1988A simulation model for determining variable worker requirements in a service operation with time-dependent customer demand

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.