Skip to main content
SpringerLink
Log in

Finite capacity assembly-like queues

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

In assembly lines, service involves assembling units coming from more than one source. In queue terminology, we may consider this situation as one in which service is rendered only to groups of customers — one from each class. In this paper we give procedures to determine response time characteristics of such a system under Markovian assumptions when a finite capacity restriction is imposed. This restriction is imposed to reflect reality as well as to make analysis tractable. In the course of this study, we also give a recursive technique to determine the distribution of the time taken for a specific number of departures in a Poisson queue from an arbitrary initial state. We demonstrate that this distribution is related to the response time distribution of the assembly-like queue. We believe that this procedure will also be of independent interest.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. O.J. Boxma, The joint arrival and departure process for the M/M/1 queue, Preprint No. 307, Dept. of Mathematics, Utrecht University (1983).

  2. J.B. Dennis, Data flow super computers, IEEE Computer 13, 11(1980)48.

    Google Scholar 

  3. J.B. Dennis and D.P. Misunas, A preliminary architecture for a basic data flow processor, in:Proc. 2nd Symp. Comp. Arch., Houston (1975) p. 126.

  4. J.M. Harrison, Assembly-like queues, J. Appl. Prob. 10(1973)354.

    Google Scholar 

  5. G. Latouche, Queues with paired customers, J. Appl. Prob. 18(1981)684.

    Google Scholar 

  6. E.H. Lipper and B. Sengupta, Assembly-like queues with finite capacity: Bounds, asymptotics and approximations, Queueing Systems, Theor. and Appl. 1(1986)67.

    Google Scholar 

  7. M.F. Neuts,Matrix-Geometric Solutions in Stochastic Models (The John Hopkins University Press, Baltimore, 1981).

    Google Scholar 

  8. C.D. Pegden and M. Rosenshine, Some new results for the M/M/1 queue, Management Science 28(1982)821.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistics, Southern Methodist University, 75275, Dallas, Texas, USA

    U. Narayan Bhat

Authors
  1. U. Narayan Bhat
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bhat, U.N. Finite capacity assembly-like queues. Queueing Syst 1, 85–101 (1986). https://doi.org/10.1007/BF01149329

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01149329

Keywords

Search

Navigation