zbMATH — the first resource for mathematics

Comparing Markov chains: aggregation and precedence relations applied to sets of states, with applications to assemble-to-order systems. (English) Zbl 1241.60035
Summary: 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.

60J10 Markov chains (discrete-time Markov processes on discrete state spaces)
60E15 Inequalities; stochastic orderings
90B25 Reliability, availability, maintenance, inspection in operations research
90B05 Inventory, storage, reservoirs
Full Text: DOI HAL