Robust Fluid Processing Networks
Name
Bertsimas_Robust fluid.pdf
Size
2.27 MB
Format
Adobe PDF
Checksum (MD5)
e0d93d2de0c5019c6f7596543d1ada3f
Author(s)
Nasrabadi, Ebrahim
Paschalidis, Ioannis Ch.
Bertsimas, Dimitris J
Date Issued
August 2014
Journal
IEEE Transactions on Automatic Control
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Bertsimas, Dimitris, Ebrahim Nasrabadi, and Ioannis Ch. Paschalidis. “Robust Fluid Processing Networks.” IEEE Transactions on Automatic Control 60, no. 3 (March 2015): 715–28.
Version
Author's final manuscript
Abstract
Fluid models provide a tractable and useful approach in approximating multiclass processing networks. However, they ignore the inherent stochasticity in arrival and service processes. To address this shortcoming, we develop a robust fluid approach to the control of processing networks. We provide insights into the mathematical structure, modeling power, tractability, and performance of the resulting model. Specifically, we show that the robust fluid model preserves the computational tractability of the classical fluid problem and retains its original structure. From the robust fluid model, we derive a (scheduling) policy that regulates how fluid from various classes is processed at the servers of the network. We present simulation results to compare the performance of our policies to several commonly used traditional methods. The results demonstrate that our robust fluid policies are near-optimal (when the optimal can be computed) and outperform policies obtained directly from the fluid model and heuristic alternatives (when it is computationally intractable to compute the optimal).
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Sloan School of Management
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/TAC.2014.2352711
