Cyclical queueing systems

Abstract Research on cyclical queueing systems is broken down into two categories: (1) cycling server models, and (2) cycling customer models. Within each category, details of a basic model are presented and then specialized models are discussed. This review presents a diverse sample of cyclical queueing models, with emphasis on current work and research directed towards applications.

[1]  Wojciech Szpankowski,et al.  Closed-network duals of multiqueues with application to token-passing systems , 1988, Comput. Syst. Sci. Eng..

[2]  Brian D. Bunday,et al.  The efficiency of M groups of N machines served by a travelling robot: comparison of two models , 1988 .

[3]  David Manfield,et al.  PERFORMANCE ANALYSIS 'OF THE 802.5 TOKEN RING STANDARD PRIORITY ACCESS MECHANISM , 1988 .

[4]  Takeshi Kawashima,et al.  ON THE SOJOURN TIME DISTRIBUTION IN CYCLIC QUEUEING SYSTEMS WITH A LiPS STATION , 1987 .

[5]  Brian D. Bunday,et al.  Machine interference—a comparison of two repair strategies , 1985 .

[6]  Brian D. Bunday,et al.  Machine interference—a comparison of two patrolling methods , 1985 .

[7]  Steven Nahmias,et al.  Stochastic Models of Internal Mail Delivery Systems , 1984 .

[8]  Ernest Koenigsberg,et al.  Twenty Five Years of Cyclic Queues and Closed Queue Networks: A Review , 1982 .

[9]  U. Yechiali,et al.  Dynamic priority rules for cyclic-type queues , 1989, Advances in Applied Probability.

[10]  Masayuki Murata,et al.  Two-layer modeling for local area networks , 1988, IEEE Trans. Commun..

[11]  H. Rudin,et al.  Analysis of successive cycles in a cyclic queue , 1984 .

[12]  Edward G. Coffman,et al.  Polling and greedy servers on a line , 1987, Queueing Syst. Theory Appl..

[13]  We-Min Chow,et al.  The Cycle Time Distribution of Exponential Cyclic Queues , 1980, JACM.

[14]  Hideaki Takagi.  Analysis and Applications of a Multiqueue Cyclic Service System with Feedback , 1987, IEEE Trans. Commun..

[15]  C. Mack,et al.  The Efficiency of N Machines Uni‐Directionally Patrolled by One Operative When Walking Time is Constant and Repair Times are Variable , 1957 .

[16]  Harry G. Perros,et al.  Approximate Throughput Analysis of Cyclic Queueing Networks with Finite Buffers , 1989, IEEE Trans. Software Eng..

[17]  Onno Boxma,et al.  Sojourn times in queueing networks , 1989 .

[18]  Willard I. Zangwill,et al.  Variance Effects in Cyclic Production Systems , 1991 .

[19]  W. P. Groenendijk.  WAITING-TIME APPROXIMATIONS FOR CYCLIC-SERVICE SYSTEMS WITH MIXED SERVICE STRATEGIES , 1988 .

[20]  Raif O. Onvural,et al.  Survey of closed queueing networks with blocking , 1990, CSUR.

[21]  B. T. Doshi,et al.  Queueing systems with vacations — A survey , 1986, Queueing Syst. Theory Appl..

[22]  Brian D. Bunday,et al.  The efficiency of uni-directionally patrolled machines with two robot repairmen , 1989 .

[23]  G. F. Newell.  Properties of Vehicle-Actuated Signals: I. One-Way Streets , 1969 .

[24]  D. Sarkar,et al.  Expected waiting time for nonsymmetric cyclic queueing systems—exact results and applications , 1989 .

[25]  Kathryn E. Stecke,et al.  On the Optimal Allocation of Servers and Workloads in Closed Queueing Networks , 1990, Oper. Res..

[26]  Gordon F. Newell,et al.  Cyclic Queuing Systems with Restricted Length Queues , 1967, Oper. Res..

[27]  Hans Daduna,et al.  Two-Stage Cyclic Queues with Nonexponential Servers: Steady-State and Cyclic Time , 1986, Oper. Res..

[28]  Onno Boxma,et al.  Pseudo-conservation laws in cyclic-service systems , 1986 .

[29]  Vincent A. Mabert,et al.  Cyclical schedules for capacitated lot sizing with dynamic demands , 1991 .

[30]  Gordon F. Newell,et al.  An analysis of elevator operation in moderate height buildings—II: Multiple elevators , 1982 .

[31]  Lionel M. Ni,et al.  Analytic Models of Cyclic Service Systems and Their Application to Token-Passing Local Networks , 1988, IEEE Trans. Computers.