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

DOI10.1287/moor.1110.0533zbMath1241.60035OpenAlexW2171290612MaRDI QIDQ2884317

Ingrid Vliegen, Ana Bušić, Alan Scheller-Wolf

Publication date: 24 May 2012

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.1110.0533

zbMATH Keywords

Markov chains precedence relations bounding models aggregation supermodularity assemble-to-order (ATO) systems

Mathematics Subject Classification ID

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

Related Items (4)

Approximating a diffusion by a finite-state hidden Markov model ⋮ Assemble-to-order systems: a review ⋮ The Benefits of State Aggregation with Extreme-Point Weighting for Assemble-to-Order Systems ⋮ Collaborative policy of the supply-hub for assemble-to-order systems with delivery uncertainty

This page was built for publication: Comparing Markov Chains: Aggregation and Precedence Relations Applied to Sets of States, with Applications to Assemble-to-Order Systems