Queueing analysis of finite buffer token networks
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Expert Systems with Applications: An International Journal
Application of analytic hierarchy process in just-in-time manufacturing systems: a review
International Journal of Data Analysis Techniques and Strategies
Closing the loop between design and market for new product idea screening decisions
Expert Systems with Applications: An International Journal
Computers and Industrial Engineering
Scheduling policies in multi-product manufacturing systems with sequence-dependent setup times
Proceedings of the Winter Simulation Conference
Hi-index | 0.02 |
This paper presents a model to analyze a manufacturing system that is operating under pull-type control. A Markovian polling model with finite queues is devised to represent the manufacturing system and studied under three cyclic service policies: exhaustive, gated, and a type of limited policy. These polling models are solved by two different methods: an exact approach that requires the complete characterization of the system as a Markov chain and a decomposition approach that reduces the size of the Markov chain. A set of numerical experiments show that the decomposition approach is quite accurate in estimating system performance measures.