Advertisement

Scheduling of Fluid Networks

  • Hong Chen
  • David D. Yao
Part of the Stochastic Modelling and Applied Probability book series (SMAP, volume 46)

Abstract

Here we study the optimal scheduling of a multiclass fluid network. We start with model formulation in Section 12.1, followed by developing a solution procedure based on linear programming in Section 12.2, and establishing several key properties of the procedure in Section 12.3. In particular, we show that the procedure involves up to 2 K iterations (K being the total number of types), and that the so-called global optimality, i.e., optimality of the objective function over every time point, is not guaranteed. In this sense, the solution procedure is termed “myopic” (or greedy). On the other hand, we show that the procedure is guaranteed to lead to the stability of the fluid network. In addition, we derive the minimum “clearing time” as the time it takes to drive all fluid levels down to zero.

Keywords

Optimal Allocation Fluid Level Admissible Control Dynamic Schedule Stochastic Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Atkins, D. AND Chen, H., Performance Evaluation of Scheduling Control of Queueing Networks: Fluid Model and Heuristics. Queueing Systems, 21 (1995), 391–413.MathSciNetzbMATHCrossRefGoogle Scholar
  2. [2]
    Avram, F., D. Bertsimas, and M. Ricard, Fluid models of sequencing problems in open queueing networks: an optimal control approach. In: Stochastic Networks, volume 71 of Proceedings of the International Mathematics Association,F.P. Kelly and R.J. Williams (ed.), Springer-Verlag, New York, 1995, 199–234Google Scholar
  3. [3]
    Bäuerle, N. and Rieder, U., Optimal Control of Single-Server Fluid Networks. Preprint, 1998.Google Scholar
  4. [4]
    Chen, H. and Mandelbaum, A., Hierarchical Modeling of Stochastic Networks, Part I: Fluid Models. In: Stochastic Modeling and Analysis of Manufacturing Systems, D.D. Yao (ed.), Springer-Verlag, New York, 1994, 47–105.CrossRefGoogle Scholar
  5. [5]
    Chen, H. And Yao, D.D., Dynamic Scheduling Control of a Multi-class Fluid Network. Operations Research, 41 (1993), 1104–1115.MathSciNetzbMATHCrossRefGoogle Scholar
  6. [6]
    Chen, H. and Yao, D.D. (1996). Stable Priority Disciplines for Multiclass Networks. In: Stochastic Networks: Stability and Rare Events, P. Glasserman, K. Sigman, and D.D. Yao (eds.), Springer-Verlag, New York, 1996, 27–39CrossRefGoogle Scholar
  7. [7]
    Chvátal, V., Linear Programming. W.H. Freeman, New York, 1983.Google Scholar
  8. [8]
    Cnnors, D., Feigin, G. And Yao, D.D., Scheduling Semiconductor Lines Using a Fluid Network Model. IEEE Trans. Robotics and Automation 10 (1994), 88–98.Google Scholar
  9. [9]
    Dai, J.G. and G. Weiss, A fluid heuristic for minimizing makespan in a job-shop. Technical report, 1999.Google Scholar
  10. [10]
    Lu, Y., Dynamic Scheduling of Stochastic Networks with Side Constraints. Ph.D. thesis, Columbia University, 1998.Google Scholar
  11. [11]
    Meyn, S. (2000). Feedback regulation for sequencing and routing in multiclass queueing networks. Preprint.Google Scholar
  12. [12]
    Sethuraman, J. Scheduling job shops and multiclass queueing networks using fluid and semidefinite relaxations. PhD. thesis, Operations Research Center, MIT, August 1999.Google Scholar
  13. [13]
    Weiss, G. (1995). On optimal draining of fluid re-entrant lines. In: Stochastic Networks, volume 71 of Proceedings of the International Mathematics Association, F.P. Kelly and R.J. Williams (ed.), Springer-Verlag, New York, 1995, 91–103.Google Scholar

Copyright information

© Springer Science+Business Media New York 2001

Authors and Affiliations

  • Hong Chen
    • 1
  • David D. Yao
    • 2
  1. 1.Faculty of Commerce and Business AdministrationUniversity of British ColumbiaVancouverCanada
  2. 2.Department of Operations Research and Industrial EngineeringColumbia UniversityNew YorkUSA

Personalised recommendations