Comparing Markov Chains: Aggregation and Precedence Relations Applied to Sets of States, with Applications to Assemble-to-Order Systems.

Share/Save/Bookmark

Busic, A. and Vliegen, I.M.H. and Scheller-Wolf, A. (2012) Comparing Markov Chains: Aggregation and Precedence Relations Applied to Sets of States, with Applications to Assemble-to-Order Systems. Mathematics of operations research, 37 (2). 259 - 287. ISSN 0364-765X

[img] PDF
Restricted to UT campus only
: Request a copy
348kB
Abstract:Solving Markov chains is, in general, difficult if the state space of the chain is very large (or infinite) and lacking a simple repeating structure. One alternative to solving such chains is to construct models that are simple to analyze and provide bounds for a reward function of interest. We present a new bounding method for Markov chains inspired by Markov reward theory: Our method constructs bounds by redirecting selected sets of transitions, facilitating an intuitive interpretation of the modifications of the original system. We show that our method is compatible with strong aggregation of Markov chains; thus we can obtain bounds for an initial chain by analyzing a much smaller chain. We illustrate our method by using it to prove monotonicity results and bounds for assemble-to-order systems.
Item Type:Article
Copyright:© 2012 INFORMS
Faculty:
Management and Governance (SMG)
Research Chair:
Research Group:
Link to this item:http://purl.utwente.nl/publications/80767
Official URL:http://dx.doi.org/10.1287/moor.1110.0533
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 286868