论文标题
使用连续的时间马尔可夫链对两层投票队列的分析
Analysis of Two-Station Polling Queues with Setups using Continuous Time Markov Chain
论文作者
论文摘要
本文分析了用设置的轮询队列串联网络的性能。对于具有两种产品和两个站的系统，我们提出了一种基于部分可碰撞状态空间表征的新方法，以降低状态空间的复杂性。在这种方法中，状态空间的大小取决于确定缓冲级和等待时间所需的信息。我们在不同的系统设置下评估系统性能，并评论方法的数值准确性，并提供管理洞察力。数值结果表明，方法得出了对性能度量的可靠估计。我们还展示了产品和站不对称如何显着影响系统性能。
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.
