Production systems with interruptions, arbitrary topology and finite buffers

We consider a production system with finite buffers and arbitrary topology where service time is subject to interruptions in one of three ways, viz. machine breakdown, machine vacations or N‐policy. We develop a unified approximation (analytical) methodology to calculate the throughput of the system using queueing networks together with decomposition, isolation and expansion techniques. The methodology is rigorously tested covering a large experimental region. Orthogonal arrays are used to design the experiments in order to keep the number of experiments manageable. The results obtained using the approximation methodology are compared to the simulation results. The t‐tests carried out to investigate the differences between the two results show that they are statistically insignificant. Finally, we test the methodology by applying it to several arbitrary topology networks. The results show that the performance of the approximation methodology is consistent, robust and produces excellent results in a variety of experimental conditions.

[1]  Guy Pujolle,et al.  Isolation Method in a Network of Queues , 1980, IEEE Transactions on Software Engineering.

[2]  Gabriel R. Bitran,et al.  A review of open queueing network models of manufacturing systems , 1992, Queueing Syst. Theory Appl..

[3]  Harry G. Perros,et al.  Approximate Analysis of Product-Form Type Queueing Networks with Blocking and Deadlock , 1988, Perform. Evaluation.

[4]  Yves Dallery,et al.  Performance evaluation of open queueing networks with arbitrary configuration and finite buffers , 1998, Ann. Oper. Res..

[5]  Irfan-Ullah Awan,et al.  MEM for arbitrary closed queueing networks with RS-blocking and multiple job classes , 1998, Ann. Oper. Res..

[6]  Surendra M. Gupta Interrelationship between controlling arrival and service in queueing systems , 1995, Comput. Oper. Res..

[7]  Sushant Jain,et al.  Open finite queueing networks with M/M/C/K parallel servers , 1994, Comput. Oper. Res..

[8]  Nico M. van Dijk,et al.  A Simple Throughput Bound for Large Closed Queueing Networks with Finite Capacities , 1989, Perform. Evaluation.

[9]  Harry G. Perros,et al.  Approximate analysis of arbitrary configurations of open queueing networks with blocking , 1987 .

[10]  Yves Dallery,et al.  On Decomposition Methods for Tandem Queueing Networks with Blocking , 1993, Oper. Res..

[11]  S. M. Gupta Machine Interference Problem With Warm Spares, Server Vacations and Exhaustive Service , 1997, Perform. Evaluation.

[12]  Rajeev Agrawal,et al.  Cyclic networks with general blocking and starvation , 1994, Queueing Syst. Theory Appl..

[13]  Stanley B. Gershwin,et al.  An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking , 1987, Oper. Res..

[14]  J. MacGregor Smith,et al.  The generalized expansion method for open finite queueing networks , 1987 .

[15]  Madhan Shridhar Phadke,et al.  Quality Engineering Using Robust Design , 1989 .

[16]  Li Zhuang,et al.  Approximate mean value performance analysis of cyclic queueing networks with production blocking , 1994, Queueing Syst. Theory Appl..

[17]  Yves Dallery,et al.  An Analytical Method for Performance Evaluation of Kanban Controlled Production Systems , 1996, Oper. Res..

[18]  Harry G. Perros A Symmetrical Exponential Open Queue Network with Blocking and Feedback , 1981, IEEE Transactions on Software Engineering.

[19]  Donald F. Towsley,et al.  Properties of fork/join queueing networks with blocking under various operating mechanisms , 1997, IEEE Trans. Robotics Autom..

[20]  Hirotaka Sakasegawa,et al.  On the equivalence of three types of blocking in non-Markovian tandem queues , 1994, Queueing Syst. Theory Appl..

[21]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[22]  Yves Dallery,et al.  Approximate Analysis of General Open Queuing Networks with Restricted Capacity , 1990, Perform. Evaluation.

[23]  Harry G. Perros Queueing networks with blocking , 1994 .

[24]  Demetres D. Kouvatsos,et al.  Arbitrary open queueing networks with server vacation periods and blocking , 1998, Ann. Oper. Res..

[25]  James MacGregor Smith,et al.  Asymptotic behavior of the expansion method for open finite queueing networks , 1988, Comput. Oper. Res..

[26]  Simonetta Balsamo,et al.  A survey of product form queueing networks with blocking and their equivalences , 1994, Ann. Oper. Res..

[27]  Stefan Helber,et al.  Decomposition of unreliable assembly/disassembly networks with limited buffer capacity and random processing times , 1998, Eur. J. Oper. Res..

[28]  Yves Dallery,et al.  Manufacturing flow line systems: a review of models and analytical results , 1992, Queueing Syst. Theory Appl..

[29]  Attahiru Sule Alfa,et al.  A Simple And Quick Approximation Algorithm For Tandem, Split And Merge Queueing Networks With Blocking , 1994 .

[30]  Raif O. Onvural,et al.  Survey of closed queueing networks with blocking , 1990, CSUR.

[31]  Jürgen Becker,et al.  Analysis of queueing networks with blocking using a new aggregation technique , 1998, Ann. Oper. Res..

[32]  Tayfur M. Altiok,et al.  Approximate analysis of exponential tandem queues with blocking , 1982 .

[33]  Mostafa H. Ammar,et al.  Equivalence Relations in Queueing Models of Fork/Join Networks with Blocking , 1989, Perform. Evaluation.

[34]  James MacGregor Smith,et al.  Buffer allocation for an integer nonlinear network design problem , 1997, Comput. Oper. Res..

[35]  S. Balasmo,et al.  Closed queueing networks with finite capacities: blocking types, product-form solution and performance indices , 1991 .

[36]  J. MacGregor Smith,et al.  An algorithm for sub-optimal routeing in series-parallel queueing networks , 1997 .

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

[38]  Boudewijn R. Haverkort,et al.  Approximate analysis of networks of PH|PH|1|K queues with customer losses: Test results , 1998, Ann. Oper. Res..

[39]  James MacGregor Smith,et al.  Buffer Space Allocation in Automated Assembly Lines , 1988, Oper. Res..

[40]  David D. Yao,et al.  Modeling a class of state-dependent routing in flexible manufacturing systems , 1985 .

[41]  Stanley B. Gershwin,et al.  Throughput estimation in cyclic queueing networks with blocking , 1998, Ann. Oper. Res..

[42]  Chii-Lian Lin,et al.  An efficient two-phase approximation method for exponential tandem queueing systems with blocking , 1995, Comput. Oper. Res..

[43]  Stanley B. Gershwin,et al.  Manufacturing Systems Engineering , 1993 .

[44]  Alexandre Brandwajn,et al.  A Note on Approximate Iterative Solution of Open Tandem Networks with Blocking , 1989, Perform. Evaluation.