Skip to main content
SpringerLink
Log in

Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We consider a two machine 3 step re-entrant line, with an infinite supply of work. The service discipline is last buffer first served. Processing times are independent exponentially distributed. We analyze this system, obtaining steady state behavior and sample path properties.

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. R-R. Chen and S.P. Meyn, Value iteration and optimization of multiclass queueing networks. Queueing Systems Theory and Applications 32 (1999) 65–97.

    Article  Google Scholar 

  2. R-R. Chen and S.P. Meyn, In search of sensitivity in network optimization. Queueing Systems Theory and Applications 44 (2003) 313–363.

    Article  Google Scholar 

  3. J.W. Cohen, The Single Server Queue (North Holland, Amsterdam, 1982).

  4. J.G. Dai and G. Weiss, Stability and instability of fluid models for re-entrant lines. Mathematics of Operations Research 21 (1994) 115–134.

    Article  Google Scholar 

  5. F.G. Foster, On the stochastic matrices associated with certain queueing processes. Ann. Math. Stat. 24 (1953) 355–360.

    Google Scholar 

  6. J.M. Harrison, Brownian models of queueing networks with heterogeneous customer populations. In Proceedings of the IMA Workshop on Stochastic Differential Systems, W. Fleming and P.L. Lions (eds.), Springer-Verlag (1988).

  7. L. Kleinrock, Queueing Systems, Vol. I: Theory (Wiley, New York, 1975).

    Google Scholar 

  8. P.R. Kumar, Re-entrant lines. Queueing Systems: Theory and Applications 13 (1993) 87–110.

    Article  Google Scholar 

  9. S. Kumar and P.R. Kumar, Performance bounds for queueing networks and scheduling policies. IEEE Transactions on Automatic Control 38 (1994) 1600–1611.

    Article  Google Scholar 

  10. Y. Nazarathy, Evaluation of on-Line Scheduling Rules for High Volume Job Shop Problems, a Simulation Study. M.A. Thesis, University of Haifa (2001).

  11. S.M. Ross, Stochastic Processes (Wiley, New York, 1983).

    Google Scholar 

  12. G. Weiss, On optimal draining of a fluid re-entrant line. In Proceedings of the IMA Workshop on Stochastic Networks, F.P. Kelly and R.J. Williams (eds.), Springer-Verlag (1995).

  13. G. Weiss, Scheduling and control of manufacturing systems—a fluid approach. In Proceedings of the 37th Allerton Conference, 21–24 September, 1999, Monticello, Illinois (1999) pp. 577–586.

  14. G. Weiss, Stability of a simple re-entrant line with infinite supply of work—the case of exponential processing times. Journal of the Operations Research Society of Japan 47 (2004) 304–313.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, HG 9.09, P.O. Box 513, 5600 MB, Eindhoven, the Netherlands

    Ivo Adan

  2. Department of Statistics, The University of Haifa, Mount Carmel, 31905, Israel

    Gideon Weiss

Authors
  1. Ivo Adan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gideon Weiss
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ivo Adan.

Additional information

AMS Subject Classifications 60K25 · 90B22

I. Adan and G. Weiss: Research supported in part by Network of Excellence Euro-NGI.

G. Weiss: Research supported in part by Israel Science Foundation Grant 249/02.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Adan, I., Weiss, G. Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy. Queueing Syst 54, 169–183 (2006). https://doi.org/10.1007/s11134-006-0065-4

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-006-0065-4

Keywords

Search

Navigation