A Fixed-Point Algorithm for Closed Queueing Networks

In this paper we propose a new efficient iterative scheme for solving closed queueing networks with phase-type service time distributions. The method is especially efficient and accurate in case of large numbers of nodes and large customer populations. We present the method, put it in perspective, and validate it through a large number of test scenarios. In most cases, the method provides accuracies within 5% relative error (in comparison to discrete-event simulation)

Serial production line performance under random variation:Dealing with the ‘Law of Variability’

Many Queueing Theory and Production Management studies have investigated specific effects of variability on the performance of serial lines since variability has a significant impact on performance. To date, there has been no single summary source of the most relevant research results concerned with variability, particularly as they relate to the need to better understand the ‘Law of Variability’. This paper fills this gap and provides readers the foundational knowledge needed to develop intuition and insights on the complexities of stochastic simple serial lines, and serves as a guide to better understand and manage the effects of variability and design factors related to improving serial production line performance, i.e. throughput, inter-departure time and flow time, under random variation