Scheduling of Fluid Networks
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.
KeywordsOptimal Allocation Fluid Level Admissible Control Dynamic Schedule Stochastic Network
Unable to display preview. Download preview PDF.
- 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
- Bäuerle, N. and Rieder, U., Optimal Control of Single-Server Fluid Networks. Preprint, 1998.Google Scholar
- Chvátal, V., Linear Programming. W.H. Freeman, New York, 1983.Google Scholar
- 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
- Dai, J.G. and G. Weiss, A fluid heuristic for minimizing makespan in a job-shop. Technical report, 1999.Google Scholar
- Lu, Y., Dynamic Scheduling of Stochastic Networks with Side Constraints. Ph.D. thesis, Columbia University, 1998.Google Scholar
- Meyn, S. (2000). Feedback regulation for sequencing and routing in multiclass queueing networks. Preprint.Google Scholar
- Sethuraman, J. Scheduling job shops and multiclass queueing networks using fluid and semidefinite relaxations. PhD. thesis, Operations Research Center, MIT, August 1999.Google Scholar
- 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