Simultaneous buffer and service rate allocation in open finite queueing networks

References

• Boxma, O. and Konheim, A. (1981) Approximate analysis of exponential queueing systems with blocking. Acta Informatica, 15, 19–26.
   Web of Science ®Google Scholar
• Buzacott, J.A. and Shantikumar, G. (1993) Stochastic Models of Manufacturing Systems, Prentice-Hall.
   Google Scholar
• Courtois, P. and Scheys, G. (1991) Minimization of the total loss rate for two finite queues in series. IEEE Transactions on Communications, 99(11), 1651–1661.
   Google Scholar
• Cruz, F.R.B., Kendall, G., While, L., Duarte, A.R. and Brito, N.L.C. (2012) Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers. Mathematical Problems in Engineering, 12, 1–19.
   Google Scholar
• Demir, L., Tunali, S. and Eliiyi, D.T. (2014) The state of the art on buffer allocation problem: A comprehensive survey. Journal of Intelligent Manufacturing, 25(3), 371–392.
   Web of Science ®Google Scholar
• Exler, O., Lehmann, T. and Schittkowski, K. (2012) MISQP: A Fortran subroutine of a trust region SQP algorithm for mixed-integer nonlinear programming-users guide. Report, Department of Computer Science, University of Bayreuth, Germany.
   Google Scholar
• Exler, O., Lehmann, T. and Schittkowski, K. (2013) A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization. Mathematical Programming Computation, 4, 383–412.
   Google Scholar
• Exler, O. and Schittkowski, K. (2007) A trust region SQP algorithm for mixed-integer nonlinear programming. Optimization Letters, 1, 269–280.
   Web of Science ®Google Scholar
• Hillier, F.S. and Bolling, R.W. (1967) Finite queues in series with exponential or Erlang service times. Operations Research, 15, 286–303.
   Web of Science ®Google Scholar
• Hillier, F.S. and So, K.C. (1995) On the optimal design of tandem queueing systems with finite buffers. Queueing Systems, 21, 245–266.
   Web of Science ®Google Scholar
• Hillier, M. and Hillier, F. (2006) Simultaneous optimization of work and buffer space in unpaced production line with random process times. IIE Transactions, 38, 39–51.
   Web of Science ®Google Scholar
• Kelly, F. (1979) Reversibilty and Stochastic Networks, Wiley, Chichester, UK.
   Google Scholar
• Kelton, D.W., Sadowski, R. and Sturrock, D. (2003) Simulation with Arena, McGraw-Hill, New York, NY.
   Google Scholar
• Kerbache, L. and Smith, J.M. (1987) The generalized expansion method for open finite queueing networks. European Journal of Operational Research, 32, 448–461.
   Web of Science ®Google Scholar
• Kerbache, L. and Smith, J.M. (1988) Asymptotic behavior of the expansion method for open finite queueing networks. Computers & Operations Research, 15(2), 157–169.
   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.
   Web of Science ®Google Scholar
• Kleinrock, L. (1975) Queueing Systems: Volume 1, Wiley.
   Google Scholar
• Labetoulle, J. and Pujolle, G. (1980) Isolation method in a network of queues. IEEE Transactions on Software Engineering, 6, 373–380.
   Web of Science ®Google Scholar
• Lemaèchal, C. (2007) The omnipresence of Lagrange. Annals of Operations Research, 153(1), 9–27.
   Web of Science ®Google Scholar
• Papadopoulos, C.T., O’Kelly, M.E.J., Vidalis, M.J. and Spinellis, D. (2009) Analysis and Design of Discrete Part Production Lines, Springer Science+Business Media, New York, NY.
   Google Scholar
• Smith, J.M. (2003) M/G/c/K blocking probability models and system performance. Performance Evaluation, 52, 237–267.
   Web of Science ®Google Scholar
• Smith, J.M. (2004) Optimal design and performance modelling of M/G/1/K queueing systems. Mathematical and Computer Modelling, 39, 1049–1081.
   Web of Science ®Google Scholar
• Smith, J.M. (2010) Robustness of state dependent queues and material handling systems. International Journal of Production Research, 48(16), 4631–4663.
   Web of Science ®Google Scholar
• Smith, J.M. (2011) Properties & performance modeling of finite buffer M/G/1/K networks. Computers and Operations Research, 38(4), 740–754.
   Web of Science ®Google Scholar
• Smith, J.M. and Barnes, R. (2015) Optimal server allocation in closed finite queueing networks. Flexible Services and Manufacturing, 27(1), 58–85.
   Web of Science ®Google Scholar
• Smith, J.M. and Cruz, F.R.B. (2005) The buffer allocation problem for general finite buffer queueing networks. IIE Transactions, 37, 343–365.
   Web of Science ®Google Scholar
• Smith, J.M. and Kerbache, L. (2012) Performance modeling of workstations & state dependent models of material handling systems with closed queueing network models. International Journal of Production Research, 50, 461-484.
   Web of Science ®Google Scholar
• Spinellis, S., Papadopoulos, C. and Smith, J.M. (2000) Large production line optimisation using simulated annealing. International Journal of Production Research, 38, 509–541.
   Web of Science ®Google Scholar
• Takahashi, Y., Miyahara, H. and Hasegawa, T. (1980) An approximation method for open restricted queueing networks. Operations Research, 28(1), 594–602.
   Google Scholar