174
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

Optimization in a two-stage multi-server service system with customer priorities

, &
Pages 326-337 | Received 28 Feb 2017, Accepted 05 Feb 2018, Published online: 01 Mar 2018

References

  • Akyildiz, I. F. (1989). Product form approximations for queueing networks with multiple servers and blocking. IEEE Transactions on Computers, 38(1), 99–114.
  • Almehdawe, E., Jewkes, B., & He, Q.-M. (2013). A markovian queueing model for ambulance offload delays. European Journal of Operational Research, 226(3), 602–614.
  • Almehdawe, E., Jewkes, B., & He, Q.-M. (2016). Analysis and optimization of an ambulance offload delay and allocation problem. Omega, 65, 148–158.
  • Andriansyah, R., Van Woensel, T., Cruz, F. R., & Duczmal, L. (2010). Performance optimization of open zero-buffer multi-server queueing networks. Computers & Operations Research, 37(8), 1472–1487.
  • Baker, J. R., Clayton, E. R., & Taylor, B. W., III. (1989). A non-linear multi-criteria programming approach for determining county emergency medical service ambulance allocations. Journal of the Operational Research Society, 40(5), 423–432.
  • Benjaafar, S., & Gupta, D. (1999). Workload allocation in multi-product, multi-facility production systems with setup times. IIE Transactions, 31(4), 339–352.
  • Calabrese, J. M. (1992). Optimal workload allocation in open networks of multiserver queues. Management Science, 38(12), 1792–1802.
  • Carter, A. J., Gould, J. B., Vanberkel, P., Jensen, J. L., Cook, J., Carrigan, S., ... Travers, A. H. (2015). Offload zones to mitigate emergency medical services (EMS) offload delay in the emergency department: A process map and hazard analysis. CJEM, 17(06), 670–678.
  • Cruz, F. R., & Smith, J. M. (2007). Approximate analysis of M/G/c/c state-dependent queueing networks. Computers & Operations Research, 34(8), 2332–2344.
  • Gail, H., Hantler, S., & Taylor, B. (1988). Analysis of a non-preemptive priority multiserver queue. Advances in Applied Probability, 20(4), 852–879.
  • Gelenbe, E., Pujolle, G., & Nelson, J. (1998). Introduction to queueing networks (Vol. 2). Chichester: Wiley.
  • Gross, D., Shortle, J., Thompson, J., & Harris, C. (2008). Fundamentals of queueing theory. New York: Wiley.
  • Han, Y., & Smith, J. M. (1991). Approximate analysis of M/M/C/K queueing networks. In R. O. Onvural & I. F. Akylldiz (Eds.), Queueing networks with finite capacity (pp. 113–126). The Netherlands: Elsevier Science.
  • Jain, S., & Smith, J. M. (1994). Open finite queueing networks with M/M/C/K parallel servers. Computers & Operations Research, 21(3), 297–317.
  • Kella, O., & Yechiali, U. (1985). Waiting times in the non-preemptive priority M/M/c queue. Stochastic Models, 1(2), 257–262.
  • Laan, C. M., Vanberkel, P. T., Boucherie, R. J., & Carter, A. J. (2016). Offload zone patient selection criteria to reduce ambulance offload delay. Operations Research for Health Care, 11, 13–19.
  • Latouche, G., & Neuts, M. F. (1980). Efficient algorithmic solutions to exponential tandem queues with blocking. SIAM Journal on Algebraic Discrete Methods, 1(1), 93–106.
  • Lee, H., & Park, T. (1995). Allocating data and workload among multiple servers in a local area network. Information Systems, 20(3), 261–269.
  • Perros, H. G. (1994). Queueing networks with blocking. Oxford: Oxford University Press.
  • Stidham, S., Jr. (2009). Optimal design of queueing systems. Chapel Hill, NC: CRC Press.
  • van Vuuren, M., Adan, I. J. B. F., & Resing-Sassen, S. A. E. (2005). Performance analysis of multi-server tandem queues with finite buffers and blocking. OR Spectrum, 27(2), 315–338.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.