Hostname: page-component-cd9895bd7-mkpzs Total loading time: 0 Render date: 2024-12-27T12:28:31.715Z Has data issue: false hasContentIssue false
  • English
  • Français

Assembly-like queues

Published online by Cambridge University Press:  14 July 2016

J. Michael Harrison
J. Michael Harrison*
Affiliation:
Stanford University
Get access Rights & Permissions [Opens in a new window]

Abstract

A queueing theoretic model of an assembly operation is introduced. The model, consisting of K ≧ 2 renewal input processes and a single server, is a multiple input generalization of the GI/G/1 queue. The server requires one input item of each type k = 1,…, K for each of his services. It is shown that the model is inherently unstable in the following sense. The associated vector waiting time process Wn cannot converge in distribution to a non-defective limit, regardless of how well balanced the input and service processes may be. Limit theorems are developed for appropriately normalized versions of Wn under the various possible load conditions. Another waiting time process, equivalent to that in a single-server queue whose input is the minimum of K renewal processes, is also identified. It is shown to converge in distribution to a particular limit under certain load conditions.

Keywords

ASSEMBLY PROCESSGI/G/1 QUEUEUNSTABLE QUEUESDONSKER'S THEOREMWAITING TIME PROCESS
Type
Research Papers
Information
Journal of Applied Probability , Volume 10 , Issue 2 , June 1973 , pp. 354 - 367
Copyright
Copyright © Applied Probability Trust 1973 

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] Billingsley, P. (1968) Convergence of Probability Measures. Wiley, New York.Google Scholar
[2] Chung, K. L. (1968) A Course in Probability Theory. Harcourt, Brace and World, New York.Google Scholar
[3] Crane, M. A. (1971) Limit theorems for queues in transportation systems. Ph.D. Dissertation. Technical Report No. 16, Department of Operations Research, Stanford University.Google Scholar
[4] Harrison, J. M. (1970) Queueing models for assembly-like systems. Ph.D. dissertation. Technical Report No. 7, Department of Operations Research, Stanford University.Google Scholar
[5] Iglehart, D. L. (1968) Weak convergence of probability measures on product spaces with application to sums of random vectors. Technical Report No. 129, Department of Operations Research, Stanford University.Google Scholar
[6] Iglehart, D. L. and Whitt, W. (1969) Multiple channel queues in heavy traffic, I. Adv. Appl. Prob. 2, 150–177.Google Scholar
[7] Iglehart, D. L. and Whitt, W. (1969) Multiple channel queues in heavy traffic, II: networks, sequences and batches. Adv. Appl. Prob. 2, 355–369.CrossRefGoogle Scholar
[8] Lindley, D. V. (1952) Theory of queues with a single server. Proc. Camb. Phil. Soc. 48, 277–289.CrossRefGoogle Scholar
[9] Whitt, W. (1968) Weak convergence theorems for queues in heavy traffic. Technical Report No. 2, Department of Operations Research, Stanford University.Google Scholar