A Queueing Network Analyzer for Manufacturing

We describe a new version of the Queueing Network Analyzer (QNA) software package that was developed especially to analyze manufacturing lines. The goal was to obtain a convenient tool for estimating capacity, work-in-process inventory and production intervals, as needed to design or change a manufacturing line. QNA is an analytic tool, based on mathematical formulas rather than simulation, and simple approximations rather than involved numerical procedures, so that it can produce results for relatively large and complex models quickly and inexpensively. In particular, QNA employs the parametric-decomposition approximation method, which has its roots . in teletraffic theory. To meet needs in the manufacturing environment, QNA has been modified to represent machine breakdown, batch service, changing lot sizes and product testing with associated repair and partial yields. QNA also has a new menu-driven screen-oriented interface using manufacturing terminology.

[1]  Hisashi Kobayashi,et al.  Accuracy of the diffusion approximation for some queuing systems , 1974 .

[2]  V. Saksena,et al.  Dependence in Packet Queues: a Multi-class Batch-poisson Model , 2011 .

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

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

[5]  W. Whitt,et al.  The Queueing Network Analyzer , 1983, The Bell System Technical Journal.

[6]  Ward Whitt,et al.  A Light-Traffic Approximation for Single-Class Departure Processes from Multi-Class Queues , 1988 .

[7]  David Y. Burman,et al.  Performance analysis techniques for IC manufacturing lines , 1986, AT&T Technical Journal.

[8]  Ward Whitt,et al.  Characterizing Superposition Arrival Processes in Packet Multiplexers for Voice and Data , 1986, IEEE J. Sel. Areas Commun..

[9]  Susan L. Albin,et al.  Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues , 1984, Oper. Res..

[10]  Clyde L. Monma,et al.  Backbone Network Design and Performance Analysis: A Methodology for Packet Switching Networks , 1986, IEEE J. Sel. Areas Commun..

[11]  W. Whitt.  On approximations for queues, I: Extremal distributions , 1984, AT&T Bell Laboratories Technical Journal.

[12]  R. I. Wilkinson.  Theories for toll traffic engineering in the U. S. A. , 1956 .

[13]  Ward Whitt,et al.  Approximating a Point Process by a Renewal Process, I: Two Basic Methods , 1982, Oper. Res..

[14]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[15]  H. Heffes.  Analysis of first-come first-served queuing systems with peaked inputs , 1973 .

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