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

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

0.00 Avg rating0 Votes
Article ID: iaor19911789
Country: United States
Volume: 38
Issue: 3
Start Page Number: 383
End Page Number: 396
Publication Date: Jun 1991
Journal: Naval Research Logistics
Authors: ,
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.