Approximation of single-class queueing networks with downtime-induced traffic variability

Queuing networks have been used with partial success for analytical modelling of manufacturing systems. In this paper, we consider a tandem system with high traffic variability caused by downtime events in the first queue. We propose improved approximation for departure variability in order to predict the waiting duration at the bottleneck queue located last in the line. We demonstrate that existing methods do not properly approximate such systems and provide some reasons and insights. Thus, a new decomposition method which employs the variability function principles is proposed. We differentiate between two components of the departure variability in multi-class systems: the ‘within-class effect’ – the variability caused by the class’ own inter-arrival and service time distributions – and the ‘between-class effect’ – the variability caused by interactions with other classes. Our analysis shows that the first effect can be approximated by existing multi-class decomposition methods, while the second effect requires a new development. Our proposed approximation for between-class effect is based on simulating a proper sub-system. The method enables modelling different policies of downtimes (e.g. FCFS, Priority). Numerical experiments show relative errors much smaller vs. existing procedures.

[1]  Kan Wu,et al.  Classification of queueing models for a workstation with interruptions: a review , 2014 .

[2]  Ward Whitt,et al.  Variability functions for parametric-decomposition approximations of queueing networks , 1995 .

[3]  P. Kuehn,et al.  Approximate Analysis of General Queuing Networks by Decomposition , 1979, IEEE Trans. Commun..

[4]  Shengwei Ding,et al.  Queueing Theory for Semiconductor Manufacturing Systems: A Survey and Open Problems , 2007, IEEE Transactions on Automation Science and Engineering.

[5]  Ward Whitt,et al.  Approximating a point process by a renewal process , 1981 .

[6]  Ward Whitt,et al.  The heavy-traffic bottleneck phenomenon in open queueing networks , 1990 .

[7]  Ward Whitt Towards better multi-class parametric-decomposition approximations for open queueing networks , 1994, Ann. Oper. Res..

[8]  J. A. Buzacott,et al.  Open queueing network models of dynamic job shops , 1981 .

[9]  Sunderesh S. Heragu,et al.  Two-level manufacturing system performance analyser , 2009 .

[10]  J. R. Jackson Networks of Waiting Lines , 1957 .

[11]  Gabriel R. Bitran,et al.  Multiproduct Queueing Networks With Deterministic Routing: Decomposition Approach and the Notion of Interference , 2015 .

[12]  Leon F. McGinnis,et al.  Queueing models for a single machine subject to multiple types of interruptions , 2011 .

[13]  Wolfgang Kraemer,et al.  Approximate Formulae for the Delay in the Queueing System GI/G/ 1 , 1976 .

[14]  Sunkyo Kim Approximation of multiclass queueing networks with highly variable arrivals under deterministic routing , 2005 .

[15]  Ward Whitt,et al.  A Queueing Network Analyzer for Manufacturing , 1989 .

[16]  J. Kingman Some inequalities for the queue GI/G/1 , 1962 .

[17]  Leon F. McGinnis,et al.  Interpolation approximations for queues in series , 2013 .

[18]  K. T. Marshall,et al.  Some Inequalities in Queuing , 1968, Oper. Res..

[19]  P T Istituto Superiore Teletraffic science for new cost-effective systems, networks, and services : 12th International Teletraffic Congress : Torino, June 1-8, 1988 , 1988 .