Analysis of Two-Station Polling Queues with Setups using Continuous Time Markov Chain

DOI10.1007/S10479-023-05768-7MaRDI QIDQ6391690zbMATH OpenOpenAlexFDO

Authors Ravi Suman, Ananth Krishnamurthy

Publication date 21 February 2022

Full work available at URL https://doi.org/10.1007/s10479-023-05768-7

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Abstract: The paper analyzes the performance of tandem network of polling queue with setups. For a system with two-products and two-stations, we propose a new approach based on a partially-collapsible state-space characterization to reduce state-space complexity. In this approach, the size of the state-space is varied depending on the information needed to determine buffer levels and waiting times. We evaluate system performance under different system setting and comment on the numerical accuracy of the approach as well as provide managerial insights. Numerical results show that approach yields reliable estimates of the performance measures. We also show how product and station asymmetry significantly affect the systems performance.

Recommendations

• Polling systems with state-dependent setup times
• Heavy traffic analysis of polling systems in tandem
• Setups in polling models: does it make sense to set up if no work is waiting?
• Analysis of tandem polling queues with finite buffers
• Control of a single-server tandem queueing system with setups

This page was built for publication: Analysis of Two-Station Polling Queues with Setups using Continuous Time Markov Chain

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6391690)