Skip to main content
Log in

Optimal control of tandem reentrant queues

  • Published:
Queueing Systems Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

We consider optimal policies for reentrant queues in which customers may be served several times at the same station. We show that for tandem reentrant queues the last-buffer first-served (LBFS) policy stochastically maximizes the departure process.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. M. Bramson, Instability of FIFO queueing networks, Ann. Appl. Probab. 6 (1996) 414-431.

    Google Scholar 

  2. P.B. Chevalierand and L.M. Wein, Scheduling networks of queues: Heavy traffic analysis of a multi-station closed network, Oper. Res. 41 (1993) 73-758.

    Google Scholar 

  3. C.R. Glassey and M. Resende, Closed-loop job release control for VLSI circuit manufacturing, IEEE Trans. Semicond. Manuf. 1 (1988) 36-46.

    Article  Google Scholar 

  4. J.M. Harrison and L.M. Wein, Scheduling networks of queues: Heavy traffic analysis of a two-station closed network, Oper. Res. 38 (1988) 1052-1064.

    Article  Google Scholar 

  5. P.K. Johri and M.N. Katehakis, Scheduling service in tandem queues attended by a single server, Stochastic. Anal. Appl. 6 (1988) 279-288.

    Google Scholar 

  6. P.R. Kumar, A tutorial on some new methods for performance evaluation of queueing networks, IEEE J. Selected Areas Commun. 13 (1995) 970-980.

    Article  Google Scholar 

  7. P.R. Kumar and T.I. Seidman, Dynamic instabilities and stabilization methods in distributed realtime scheduling of manufacturing systems, IEEE Trans. Automat. Control 35 (1990) 289-298.

    Article  Google Scholar 

  8. Z. Liu and R. Righter, Optimal scheduling on parallel processors with precedence constraints and general costs, Probab. Engrg. Inform. Sci. 11 (1997) 79-93.

    Article  Google Scholar 

  9. C. Lozinski and C.R. Glassey, Bottleneck starvation indicators for shop floor control, IEEE Trans. Semicond. Manuf. 1 (1988) 147-153.

    Article  Google Scholar 

  10. S.C.H. Lu and P.R. Kumar, Distributed scheduling based on due dates and buffer priorities, IEEE Trans. Automat. Control 36 (1991) 1406-1416.

    Article  Google Scholar 

  11. S.C.H. Lu, D. Ramaswamy and P.R. Kumar, Efficient scheduling policies to reduce mean and variance of cycle-time in semiconductor manufacturing plants, IEEE Trans. Semicond. Manuf. 7 (1994) 374-388.

    Article  Google Scholar 

  12. R. Righter and J.G. Shanthikumar, Extremal properties of the FIFO discipline in queueing networks, J. Appl. Probab. 29 (1992) 967-978.

    Article  Google Scholar 

  13. T.I. Seidman, First come first serve can be unstable, IEEE Trans. Automat. Control 39 (1994) 2166-2170.

    Article  Google Scholar 

  14. L.M. Wein, Scheduling semiconductor wafer fabrication, IEEE Trans. Semicond. Manuf. 1 (1988) 115-130.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Koole, G., Righter, R. Optimal control of tandem reentrant queues. Queueing Systems 28, 337–347 (1998). https://doi.org/10.1023/A:1019111525648

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019111525648