Hostname: page-component-77c89778f8-gq7q9 Total loading time: 0 Render date: 2024-07-20T03:34:14.537Z Has data issue: false hasContentIssue false
  • English
  • Français

Dynamic priority rules for cyclic-type queues

Published online by Cambridge University Press:  01 July 2016

Sid Browne  and
Uri Yechiali
Sid Browne*
Affiliation:
Columbia University
Uri Yechiali*
Affiliation:
Tel Aviv University
*
∗Postal address: Graduate School of Business, 402 Uris Hall, Columbia University, New York, NY 10027, USA.
∗∗Postal address: Department of Statistics, Tel Aviv University, Tel Aviv, Israel.
Get access Rights & Permissions [Opens in a new window]

Abstract

A cyclic service system is composed of K channels (queues) and a single cyclically roving server who typically takes a positive amount of time to switch between channels. Research has previously focused on evaluating and computing performance measures (notably, waiting times) of fixed template routing schemes under three main service disciplines, the exhaustive, gated and limited service regimes.

In this paper, probabilistic results are derived that allow control strategies and optimal policies to be considered for the first time. By concentrating on a new objective function, we are able to derive rules of index form amenable for direct implementation to dynamically control the system at suitably defined decision epochs. These rules utilize current system information, are of an adaptive nature, and are shown to emanate from a general physical principle.

Keywords

CYCLIC QUEUESPOLLING SYSTEMSSTOCHASTIC SCHEDULING
Type
Research Article
Information
Advances in Applied Probability , Volume 21 , Issue 2 , June 1989 , pp. 432 - 450
Copyright
Copyright © Applied Probability Trust 1989 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Avi-Itzhak, B., Maxwell, W. L. and Miller, L. W. (1965) Queues with alternating priorities. Operat. Res. 13, 306–318.Google Scholar
Baker, J. E. and Rubin, I. (1987) Polling with a general-service order table. IEEE Trans. Comm. 35, 283–288.CrossRefGoogle Scholar
Bertsekas, D. P. (1987) Dynamic Programming. Prentice-Hall, Englewood Cliffs, NJ.Google Scholar
Boxma, O. J. and Groenendijk, W. P. (1987) Pseudo-conservation laws in cyclic service systems J. Appl. Prob. 24, 949–964.Google Scholar
Browne, S. and Yechiali, U. (1987) Scheduling deteriorating jobs on a single processor.Google Scholar
Cobham, A. (1954) Priority assignment in waiting line problems. Operat. Res. 2, 70–76.Google Scholar
Cooper, R. B. (1970) Queues served in cyclic order, waiting times. Bell Syst. Tech. J. 49, 399–413.Google Scholar
Cooper, R. B. (1981) Introduction to Queueing Theory, 2nd edn. North-Holland, Amsterdam.Google Scholar
Eisenberg, M. (1972) Queues with periodic service and changeover times. Operat. Res. 20, 440–451.CrossRefGoogle Scholar
Gittins, J. C. (1982) Forwards induction and dynamic allocation indices. In Deterministic and Stochastic Scheduling, ed. Dempster, M. A. H. et al. D. Reidel, Dordrecht, 125–156.CrossRefGoogle Scholar
Konheim, A. G. and Meister, B. (1974) Waiting lines and times in a system with polling. J. Assoc. Comput. Mach. 21, 470–490.Google Scholar
Levy, Y, and Yechiali, U. (1975) Utilization of idle time in an M/G/1 queueing system. Management Sci. 22, 202–211.CrossRefGoogle Scholar
Ross, S. (1970) Applied Probability Models with Optimization Applications. Holden Day, San Francisco.Google Scholar
Takács, L. (1967) Combinatorial Methods in the Theory of Stochastic Processes. Wiley, New York.Google Scholar
Takács, L. (1968) Two queues attended by a single server. Operat. Res. 16, 639–650.CrossRefGoogle Scholar
Takagi, H. (1986) Analysis of Polling Systems. MIT Press, Cambridge, Mass.Google Scholar
Takagi, H. (1987) A survey of queueing analysis of polling systems. Proc. 3rd Internat. Conf. Data Communications Systems and Their Performance, Rio de Janeiro.Google Scholar
Watson, K. S. (1984) Performance evaluation of cyclic service strategies—a survey. In Performance '84, ed. Gelenbe, E., North-Holland, Amsterdam, 521–533.Google Scholar
Whittle, P. (1982) Optimization Over Time, Vol. I. Wiley, New York.Google Scholar
Yechiali, U. (1976) A new derivation of the Khintchine–Pollaczek formula. Operational Research 75, ed. Haley, K. B., North-Holland, Amsterdam. 261–264.Google Scholar