Computational Performance Bounds for Markov Chains With Applications

For Markov chains exhibiting translation invariance of their transition probabilities on polyhedra covering the state space, we develop computational performance bounds for key measures of system performance. Duality allows us to obtain linear programming performance bounds. The Markov chains considered can be used to model multiclass queueing networks operating under affine index policies, a class of policies which subsume many that have been proposed.

[1]  S. Sushanth Kumar,et al.  Performance bounds for queueing networks and scheduling policies , 1993, Proceedings of 32nd IEEE Conference on Decision and Control.

[2]  James R. Morrison,et al.  Linear Programming Performance Bounds for Markov Chains With Polyhedrally Translation Invariant Probabilities and Applications to Unreliable Manufacturing Systems and Enhanced Wafer Fab Models , 2002 .

[3]  J. R. Morrison,et al.  New Linear Program Performance Bounds for Queueing Networks , 1999 .

[4]  Sean P. Meyn.  Workload models for stochastic networks: value functions and performance evaluation , 2005, IEEE Transactions on Automatic Control.

[5]  S.C.H. Lu,et al.  Efficient scheduling policies to reduce mean and variance of cycle-time in semiconductor manufacturing plants , 1994 .

[6]  Panganamala Ramana Kumar,et al.  New Linear Program Performance Bounds for Closed Queueing Networks , 2001, Discret. Event Dyn. Syst..

[7]  Sean P. Meyn,et al.  Duality and linear programs for stability and performance analysis of queuing networks and scheduling policies , 1996, IEEE Trans. Autom. Control..

[8]  J. LaFreniere,et al.  Implementation of a Fluctuation Smoothing Production Control Policy in IBM’s 200mm Wafer Fab , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[9]  John N. Tsitsiklis,et al.  Optimization of multiclass queuing networks: polyhedral and nonlinear characterizations of achievable performance , 1994 .

[10]  M. Veatch.  Approximate Dynamic Programming for Networks : Fluid Models and Constraint Reduction , 2004 .

[11]  Benjamin Van Roy,et al.  The Linear Programming Approach to Approximate Dynamic Programming , 2003, Oper. Res..

[12]  Sean P. Meyn,et al.  Duality and linear programs for stability and performance analysis of queueing networks and scheduling policies , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.