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 2K 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Atkins, D. AND Chen, H., Performance Evaluation of Scheduling Control of Queueing Networks: Fluid Model and Heuristics. Queueing Systems, 21 (1995), 391–413.
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–234
Bäuerle, N. and Rieder, U., Optimal Control of Single-Server Fluid Networks. Preprint, 1998.
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.
Chen, H. And Yao, D.D., Dynamic Scheduling Control of a Multi-class Fluid Network. Operations Research, 41 (1993), 1104–1115.
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–39
Chvátal, V., Linear Programming. W.H. Freeman, New York, 1983.
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.
Dai, J.G. and G. Weiss, A fluid heuristic for minimizing makespan in a job-shop. Technical report, 1999.
Lu, Y., Dynamic Scheduling of Stochastic Networks with Side Constraints. Ph.D. thesis, Columbia University, 1998.
Meyn, S. (2000). Feedback regulation for sequencing and routing in multiclass queueing networks. Preprint.
Sethuraman, J. Scheduling job shops and multiclass queueing networks using fluid and semidefinite relaxations. PhD. thesis, Operations Research Center, MIT, August 1999.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Chen, H., Yao, D.D. (2001). Scheduling of Fluid Networks. In: Fundamentals of Queueing Networks. Stochastic Modelling and Applied Probability, vol 46. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-5301-1_12
Download citation
DOI: https://doi.org/10.1007/978-1-4757-5301-1_12
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-2896-2
Online ISBN: 978-1-4757-5301-1
eBook Packages: Springer Book Archive