Premium
Dynamic scheduling in single‐server multiclass service systems with unit buffers
Author(s) -
Browne Sid,
Yechiali Uri
Publication year - 1991
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199106)38:3<383::aid-nav3220380308>3.0.co;2-d
Subject(s) - polling system , computer science , polling , queue , scheduling (production processes) , service (business) , real time computing , distributed computing , mathematical optimization , computer network , mathematics , economy , economics
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.