Performance analysis of open general queuing networks with blocking and feedback

References

• Altiok, T., and H. G. Perros. 1987. “Approximate Analysis of Arbitrary Configurations of Open Queueing Networks with Blocking.” Annals of Operations Research 9 (1): 481–509.10.1007/BF02054751
   Google Scholar
• Artalejo, J. R., and A. Gómez-Corral. 2008. Retrial Queueing Systems. New York: Springer.10.1007/978-3-540-78725-9
   Google Scholar
• Balsamo, S., and V. de Nitto Personé, and R. Onvural. 2001. Analysis of Queuing Networks with Blocking. Netherlands: Kluwer Academic Publishers.10.1007/978-1-4757-3345-7
   Google Scholar
• Bar-Lev, S. K., O. Boxma, W. Stadje, F. A. Van der Duyn Schouten, and C. Wiesmeyr. 2009. “Two-stage Queueing Network Models for Quality Control and Testing.” European Journal of Operational Research 198 (3): 859–866.10.1016/j.ejor.2008.09.040
   Web of Science ®Google Scholar
• Disney, R. L., and D. König. 1985. “Queueing Networks: A Survey of Their Random Processes.” SIAM Review 27 (3): 335–403.10.1137/1027109
   Web of Science ®Google Scholar
• Gao, S., Z. M. Liu, and H. Dong. 2012. “A Repairable Discrete-time Retrial Queue with Recurrent Customers, Bernoulli Feedback and General Retrial times.” Operational Research 12 (3): 367–383.10.1007/s12351-010-0098-7
   Web of Science ®Google Scholar
• Gelenbe, E. 1975. “On Approximate Computer System Models.” Journal of the ACM 22 (2): 261–269.10.1145/321879.321888
   Web of Science ®Google Scholar
• Gijsen, B. M. M., R. D. van der Mei, P. Engelberts, J. L. van den Berg, and K. M. C. van Wingerden. 2006. “Sojourn Time Approximations in Queueing Networks with Feedback.” Performance Evaluation 63 (8): 743–758.10.1016/j.peva.2005.08.002
   Web of Science ®Google Scholar
• Gross, D., J. F. Shortie, J. M. Thompson, and C. M. Harris. 2008. Fundamentals of Queueing Theory. 4th ed. New York: Wiley.10.1002/9781118625651
   Google Scholar
• Gupta, S. M., and A. Kavusturucu. 2000. “Production Systems with Interruptions, Arbitrary Topology and Finite Buffers.” Annals of Operations Research 93 (1/4): 145–176.10.1023/A:1018971822978
   Web of Science ®Google Scholar
• Hannibalsson, I., and R. L. Disney. 1977. “An M/M/1 Queue with Delayed Feedback.” Naval Research Logistics Quarterly 24 (2): 281–291.10.1002/(ISSN)1931-9193
   Google Scholar
• Haskose, A. 2001. “Queueing Network Models for Workload Control in the Make-to-order Sector.” PhD diss., University of Lancaster.
   Google Scholar
• Haskose, A., B. G. Kingsman, and D. Worthington. 2002. “Modelling Flow and Jobbing Shops as a Queueing Network for Workload Control.” International Journal of Production Economics 78 (3): 271–285.10.1016/S0925-5273(01)00117-7
   Web of Science ®Google Scholar
• Haskose, A., B. G. Kingsman, and D. Worthington. 2004. “Performance Analysis of Make-to-order Manufacturing Systems under Different Workload Control Regimes.” International Journal of Production Economics 90 (2): 169–186.10.1016/S0925-5273(03)00052-5
   Web of Science ®Google Scholar
• Jackson, J. R. 1963. “Jobshop-like Queueing Systems.” Management Science 10 (1): 131–142.10.1287/mnsc.10.1.131
   Web of Science ®Google Scholar
• K. P. Jun, and H. G. Perros. 1989. “Approximate Analysis of Arbitrary Configuration of Queueing Networks with Blocking”. In Queueing Networks with Finite Capacity: Proceedings of the First Workshop on Queueing Networks with Blocking, edited by H. G. Perros and T. Altiok, 259–280, Elsevier Science & Technology.
   Google Scholar
• Kavusturucu, A., and S. M. Gupta. 1999. “Manufacturing Systems with Machine Vacations, Arbitrary Topology and Finite Buffers.” International Journal of Production Economics 58 (1): 1–15.10.1016/S0925-5273(98)00209-6
   Web of Science ®Google Scholar
• Kerbachea, L., and J. M. Smith. 1987. “The Generalized Expansion Method for Open Finite Queueing Networks.” European Journal of Operational Research 32 (3): 448–461.10.1016/S0377-2217(87)80012-7
   Web of Science ®Google Scholar
• Kerbache, L., and J. M. Smith. 2000. “Multi-objective Routing within Large Scale Facilities Using Open Finite Queueing Networks.” European Journal of Operational Research 121 (1): 105–123.10.1016/S0377-2217(99)00018-1
   Web of Science ®Google Scholar
• Kimura, T. 1996. “A Transform-Free Approximation for the Finite Capacity M/G/s Queue.” Operations Research 44 (6): 984–988.10.1287/opre.44.6.984
   Web of Science ®Google Scholar
• Kouvatsos, D., and N. P. Xenios. 1989. “MEM for Arbitrary Queueing Networks with Multiple General Servers and Repetitive-service Blocking.” Performance Evaluation 10 (3): 169–195.10.1016/0166-5316(89)90009-6
   Web of Science ®Google Scholar
• Kuehn, P. 1979. “Approximate Analysis of General Queuing Networks by Decomposition.” IEEE Transactions on Communications 27 (1): 113–126.10.1109/TCOM.1979.1094270
   Web of Science ®Google Scholar
• Kumar, B. K., S. P. Madheswari, and S. R. A. Lakshmi. 2013. “An M/G/1 Bernoulli Feedback Retrial Queueing System with Negative Customers.” Operational Research 13 (2): 187–210.10.1007/s12351-011-0107-5
   Web of Science ®Google Scholar
• Labetoulle, J., and G. Pujolle. 1980. “Isolation Method in a Network of Queues.” IEEE Transactions on Software Engineering SE-6 (4): 373–381.10.1109/TSE.1980.234493
   Web of Science ®Google Scholar
• Lee, H. S., and S. M. Pollock. 1990. “Approximation Analysis of Open Acyclic Exponential Queueing Networks with Blocking.” Operations Research 38 (6): 1123–1134.10.1287/opre.38.6.1123
   Web of Science ®Google Scholar
• Lee, H. S., A. Bouhchouch, Y. Dallery, and Y. Frein. 1998. “Performance Evaluation of Open Queueing Networks with Arbitrary Configuration and Finite Buffers.” Annals of Operations Research 79: 181–206.10.1023/A:1018918604554
   Web of Science ®Google Scholar
• Marshall, K. T. 1968. “Some Inequalities in Queuing.” Operations Research 16: 651–668.10.1287/opre.16.3.651
   Web of Science ®Google Scholar
• Noh, Y. D. 1997. “Computational Algorithm for an M-stage Open Tandem Queue with Blocking and Feedback Operation.” Computers & Industrial Engineering 32 (2): 445–454.10.1016/S0360-8352(96)00217-3
   Web of Science ®Google Scholar
• Perros, H. G. 1981. “A Symmetrical Exponential Open Queue Network with Blocking and Feedback.” IEEE Transactions on Software Engineering SE-7: 395–402.10.1109/TSE.1981.234542
   Web of Science ®Google Scholar
• Perros, H. G. 1994. Queueing Networks with Blocking. New York: Oxford University Press.
   Google Scholar
• Perros, H. G., and P. M. Snyder. 1989. “A Computationally Efficient Approximation Algorithm for Feed-forward Open Queueing Networks with Blocking.” Performance Evaluation 9 (3): 217–224.10.1016/0166-5316(89)90028-X
   Web of Science ®Google Scholar
• Segal, M., and W. Whitt. 1989. “A Queueing Network Analyzer for Manufacturing.” Teletraffic Science for New Cost-effective Systems, Networks and Services, ITC 12: 1146–1152.
   Google Scholar
• Smith, J. M. 2014. “System Capacity and Performance Modelling of Finite Buffer Queueing Networks.” International Journal of Production Research 52 (11): 3125–3163.10.1080/00207543.2013.854935
   Web of Science ®Google Scholar
• Smith, J. M., and F. R. B. Cruz. 2005. “The Buffer Allocation Problem for General Finite Buffer Queueing Networks.” IIE Transactions 37 (4): 343–365.10.1080/07408170590916986
   Web of Science ®Google Scholar
• Smith, J. M., F. R. B. Cruz, and T. van Woensel. 2010. “Topological Network Design of General, Finite, Multi-server Queueing Networks.” European Journal of Operational Research 201 (2): 427–441.10.1016/j.ejor.2009.03.012
   Web of Science ®Google Scholar
• Stoldt, J., A. Schlegel, and M. Putz. 2016. “Enhanced Integration of Energy-related Considerations in Discrete Event Simulation for Manufacturing Applications.” Journal of Simulation 10 (2): 113–122.10.1057/jos.2015.24
   Web of Science ®Google Scholar
• Takács, L. 1963. “A Single Server Queue with Feedback.” Bell System Technical Journal 42 (2): 505–519.10.1002/bltj.1963.42.issue-2
   Google Scholar
• Takahashi, Y., H. Miyahara, and T. Hasegawa. 1980. “An Approximation Method for Open Restricted Queueing Networks.” Operations Research 28 (3): 594–602.10.1287/opre.28.3.594
   Web of Science ®Google Scholar
• Tijms, H. C. 2003. A First Course in Stochastic Models. New York: Wiley.10.1002/047001363X
   Google Scholar
• Upadhyaya, S. 2016. “Performance Prediction of a Discrete-time Batch Arrival Retrial Queue with Bernoulli Feedback.” Applied Mathematics and Computation 283: 108–119.10.1016/j.amc.2016.02.026
   Web of Science ®Google Scholar
• van der Mei, R. D., B. M. M. Gijsen, N. in’t Veld, and J. L. van der Berg. 2002. “Response times in a Two-node Queueing Network with Feedback.” Performance Evaluation 49 (1–4): 99–110.10.1016/S0166-5316(02)00121-9
   Web of Science ®Google Scholar
• van Woensel, T., and F. R. B. Cruz. 2014. “Optimal Routing in General Finite Multi-server Queueing Networks.” PLoS ONE 9 (7): e102075.10.1371/journal.pone.0102075
   PubMed Web of Science ®Google Scholar
• Van Woensel, T., R. Andriansyah, F. R. B. Cruz, J. M. Smith, and L. Kerbache. 2010. “Buffer and Server Allocation in General Multi-server Queueing Networks.” International Transactions in Operational Research 17 (2): 257–286.10.1111/itor.2010.17.issue-2
   Web of Science ®Google Scholar
• Whitt, W. 1982. “Approximating a Point Process by a Renewal Process, I: Two Basic Methods.” Operations Research 30 (1): 125–147.10.1287/opre.30.1.125
   Web of Science ®Google Scholar
• Whitt, W. 1983. “The Queueing Network Analyzer.” Bell System Technical Journal 62 (9): 2779–2815.10.1002/bltj.1983.62.issue-9
   Google Scholar
• Zhang, H. Y., Q. X. Chen, and N. Mao. 2016. “System Performance Analysis of Flexible Flow Shop with Match Processing Constraint.” International Journal of Production Research 54 (20): 6052–6070.10.1080/00207543.2016.1166286
   Web of Science ®Google Scholar