Skip to main content
SpringerLink
Log in

An algorithm for minimum wait drainingof two‐station fluid re‐entrant line

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In a fluid re‐entrant line, fluid moves through a sequence of K buffers, partitioned by their service to I stations. We consider theinitial fluid in the system, with no external input.Our objective is to empty all the fluid in the line with minimum total inventory. We presenta polynomial time algorithm for this problem, for the case I = 2.

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. E.J. Anderson, A new continuous model for job-shop scheduling, International J. Systems Science 12(1981)1469-1475.

    Google Scholar 

  2. E.J. Anderson and P. Nash, Linear Programming in Infinite Dimensional Spaces, Wiley-Interscience, Chichester, 1987.

    Google Scholar 

  3. E.J. Anderson and M.C. Pullan, Purification for separated continuous linear programs, Report CUED E-MS TR, Cambridge University, Preprint 1995.

  4. F. Avram, D. Bertsimas and M. Ricard, Fluid models of sequencing problems in open queueing networks; An optimal control approach, in: Stochastic Networks, IMA Volumes in Mathematics and its Applications, eds. F.P. Kelly and R. Williams, Springer, New York, 1995, pp. 199-234.

    Google Scholar 

  5. D. Bertsimas and X. Luo, Separated continuous linear programming: Theory, algorithms, and applications, SIAM J. Control and Optimization (1997), to appear.

  6. D. Bertsimas, I. Paschalidis and J. Tsitsiklis, Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance, Annals of Applied Probability 4(1994) 43-75.

    Google Scholar 

  7. R.R. Chen and S.P. Meyn, Value iteration and optimization of multiclass queueing networks, Preprint, 1997.

  8. J.G. Dai, On positive Harris recurrence for multiclass queueing networks: A unified approach via fluid limit models, Annals of Applied Probability 5(1995)49-77.

    Google Scholar 

  9. J.G. Dai, A fluid-limit model criterion for instability of multiclass queueing networks, Annals of Applied Probability 6(1996)751-756.

    Google Scholar 

  10. J.G. Dai and J. Vande-Vate, Global stability of two-station queueing networks, Proceedings of the Workshop on Stochastic Networks: Stability and Rare Events, eds. P. Glasserman, K. Sigman and D. Yao, Springer, New York, 1996, pp. 1-26.

    Google Scholar 

  11. J.G. Dai and G. Weiss, Almost optimal fluid based job shop heuristic, Preprint, 1997.

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

  13. J.M. Harrison, The BIGSTEP approach to flow management in stochastic processing networks, in: Stochastic Networks: Theory and Applications, eds. F.P. Kelly, I. Ziedins and S. Zachary, Oxford University Press, 1996.

  14. P.R. Kumar, Re-entrant lines, Queueing Systems 13(1993)87-110.

    Google Scholar 

  15. P.R. Kumar, Performance bounds for queueing networks and scheduling policies, IEEE Transactions on Automatic Control 39(1994)1600-1611.

    Google Scholar 

  16. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, Sequencing and scheduling, algorithms and complexity, in: Handbooks in Operations Research and Management Science, Vol. 4: Logistics of Production and Inventory, eds. S.C. Graves, A.H.G. Rinnooy Kan and P. Zipkin, North-Holland, 1993.

  17. C. Magalaras, Design of dynamic control policies for stochastic processing networks via fluid networks, in: IEEE Proceedings CDC97, 1997, to appear.

  18. S.P. Meyn, The policy improvement algorithm for Markov decision processes with general state space, IEEE Transactions on Automatic Control (1995), to appear.

  19. S.P. Meyn, Stability and optimization of queueing networks and their fluid models, Proceedings of the Summer Seminar on the Mathematics of Stochastic Manufacturing Systems, Williamsburg, VA, June 17-21, 1996.

  20. M.C. Pullan, An algorithm for a class of continuous linear programs, SIAM J. Control and Optimization 31(1993)1558-1577.

    Google Scholar 

  21. M.C. Pullan, Forms of optimal solutions for separated continuous linear programs, SIAM J. Control and Optimization 33(1995)1952-1977.

    Google Scholar 

  22. M.C. Pullan, A duality theory for separated continuous linear programs, SIAM J. Control and Optimization 34(1996), to appear.

  23. M.C. Pullan, Convergence of a general class of algorithms for separated continuous linear programs, Report CUED E-MS TR, Cambridge University, Preprint, 1995.

  24. M.C. Pullan, Existence and duality theory for separated continuous linear programs, Mathematical Modeling of Systems 1(1996), to appear.

  25. L.M. Wein, Scheduling networks of queues: Heavy traffic analysis of a multistation network with controllable inputs, Operations Research 40(1992)S312-S334.

    Google Scholar 

  26. G. Weiss, On optimal draining of fluid re-entrant lines, in: Stochastic Networks, IMA Volumes in Mathematics and its Applications, eds. F.P. Kelly and R. Williams, Springer, New York, 1995, pp. 93-105.

    Google Scholar 

  27. G. Weiss, Optimal draining of fluid re-entrant lines: Some solved examples, in: Stochastic Networks: Theory and Applications, eds. F.P. Kelly, I. Ziedins and S. Zachary, Oxford University Press, 1996.

Download references

Authors
  1. G. Weiss
    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

Weiss, G. An algorithm for minimum wait drainingof two‐station fluid re‐entrant line. Annals of Operations Research 92, 65–86 (1999). https://doi.org/10.1023/A:1018907403413

Download citation

  • Issue Date:

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

Keywords

Search

Navigation