Dynamic scheduling in single‐server multiclass service systems with unit buffers

The problem of optimal dynamic sequencing for a single‐server multiclass service system with only unit storage (buffer) space at each queue is considered. The model is applicable to many computer operating and telecommunicating systems (e.g., polling systems). Index policies to minimize costs for the special case of symmetric arrival rates are derived. Simulations suggest that using these indices provides a substantial improvement over cyclic schedules.