Hostname: page-component-78c5997874-s2hrs Total loading time: 0 Render date: 2024-11-14T07:27:29.306Z Has data issue: false hasContentIssue false
  • English
  • Français

A non-exponential queueing system with independent arrivals and batch servicing

Published online by Cambridge University Press:  14 July 2016

Nico M. Van Dijk  and
Eric Smeitink
Nico M. Van Dijk
Affiliation:
Free University, Amsterdam
Eric Smeitink*
Affiliation:
Free University, Amsterdam
*
∗Postal address for both authors: Faculty of Economics and Econometrics, Free University, P.O. Box 7161, 1007 MC Amsterdam, The Netherlands.
Get access Rights & Permissions [Opens in a new window]

Abstract

We study a queueing system with a finite number of input sources. Jobs are individually generated by a source but wait to be served in batches, during which the input of that source is stopped. The service speed of a server depends on the mode of other sources and thus includes interdependencies. The input and service times are allowed to be generally distributed. A classical example is a machine repair system where the machines are subject to shocks causing cumulative damage. A product-form expression is obtained for the steady state joint queue length distribution and shown to be insensitive (i.e. to depend on only mean input and service times). The result is of both practical and theoretical interest as an extension of more standard batch service systems.

Keywords

PRODUCT FORMINSENSITIVITYSOURCE BALANCE
Type
Research Papers
Information
Journal of Applied Probability , Volume 27 , Issue 2 , June 1990 , pp. 401 - 408
Copyright
Copyright © Applied Probability Trust 1990 

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

[1] Arthurs, E. and Kaufman, J. S. (1979) Sizing a message store subject to blocking criteria. In Performance of Computer Systems. ed. Arato, M., Butrimenko, A. and Gelenbe, E., North-Holland, Amsterdam, 547–564.Google Scholar
[2] Barbour, A. (1976) Networks of queues and the method of stages. Adv. Appl. Prob. 8, 584–591.Google Scholar
[3] Dynkin, E. B. (1965) Markov Processes 1. Springer-Verlag, Berlin.Google Scholar
[4] Federgruen, A. and Green, L. (1983) An M/G/c queue in which the number of servers required is random. Columbia Bus. Sch. Res. Paper 504A, Colombia University.Google Scholar
[5] Fletcher, G. Y., Perros, H. G. and Stewart, W. J. (1986) A queueing system where customers require a random number of servers simultaneously. EJOR 23, 331–342.Google Scholar
[6] Gavish, B. and Schweitzer, P. J. (1977) The Markovian queue with bounded waiting time. Management Sci. 23, 1349–1357.CrossRefGoogle Scholar
[7] Green, L. (1980) A queueing system in which customers require a random number of servers. Operat. Res. 28, 1335–1346.Google Scholar
[8] Green, L. (1981) Comparing operating characteristics of queues in which customers require a random number of servers. Management Sci. 27, 65–74.Google Scholar
[9] Hordijk, A. and Van Dijk, N. M. (1983) Adjoint process, job-local-balance and insensitivity of stochastic networks. Bull. 44th Session Int. Inst. Statist. 50, 776–788.Google Scholar
[10] Kaufman, J. (1981) Blocking in a shared resource environment. IEEE Trans. Comm. 29, 1474–1481.CrossRefGoogle Scholar
[11] Keilson, J. (1963) A gambler's ruin problem in queueing theory. Operat. Res. 570–576.Google Scholar
[12] Molloy, M. R. (1985) Discrete time stochastic Petri nets IEEE Trans. Software Eng. 4, 417–423.Google Scholar
[13] Schassberger, R. (1978) The insensitivity of stationary probabilities in networks of queues. Adv. Appl. Prob. 10, 906–912.Google Scholar
[14] Schwartz, M. and Kraimeche, B. (1983) An analytic control model for an integrated mode. Infocom '83, San Diego.Google Scholar
[15] Seila, A. F. (1984) On waiting times for a queue in which customers require simultaneous service from a random number of servers. Operat. Res. 32, 1181–1184.Google Scholar
[16] Taylor, P. G. (1987) Aspects of Insensitivity in Stochastic Processes. Ph.D. Dissertation, University of Adelaide.Google Scholar
[17] Whitt, W. (1985) Blocking when service is required from several facilities simultaneously AT&T Tech. J. 64, 1807–1856.Google Scholar
[18] Whittle, P. (1985) Partial balance and insensitivity. J. Appl. Prob. 22, 168–176.Google Scholar
[19] Whittle, P. (1986) Systems in Stochastic Equilibrium. Wiley, Chichester.Google Scholar