Study of a class of partially ordered service strategies for a system of two discrete-time queues

A discrete-time system of two queues served according to distinct policies is studied in this paper: one queue receives 1-limited service; the other is served according to some policy from the introduced class of (state dependent) policies S. Class S contains traditional service policies as well as ad hoc policies. A partial performance ordering of policies in S is derived which can be useful in designing ad hoc policies with improved performance compared to that of traditional policies. Some examples of ad hoc policies in S are presented and numerical results are derived to illustrate the potential for efficiency provided by service policies in S.