Table of Contents Author Guidelines Submit a Manuscript
Advances in Operations Research
Volume 2016, Article ID 3478709, 8 pages
http://dx.doi.org/10.1155/2016/3478709
Research Article

Selective Trunk with Multiserver Reservation

1Department of Industrial Engineering and Management, Faculty of Engineering and Architecture, American University of Beirut, Beirut 1107 2020, Lebanon
2Department of Mathematics and Statistics, University of Southern Maine, 96 Falmouth Street, Portland, ME 04104-9300, USA

Received 3 November 2015; Revised 28 January 2016; Accepted 29 March 2016

Academic Editor: Yiqiang Zhao

Copyright © 2016 Bacel Maddah and Muhammad El-Taha. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. El-Taha and J. R. Heath, “Traffic overflow in loss systems with selective trunk reservation,” Performance Evaluation, vol. 41, no. 4, pp. 295–306, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  2. J. M. Akinpelu, “The overload performance of engineered networks with nonhierarchical and hierarchical routing,” The Bell System Technical Journal, vol. 63, no. 7, 1984. View at Google Scholar
  3. A. Girard, “Blocking probability of noninteger groups with trunk reservation,” IEEE Transactions on Communications, vol. 33, no. 2, pp. 113–120, 1985. View at Publisher · View at Google Scholar · View at Scopus
  4. F. Le Gall and J. Bernussou, “Blocking probabilities for trunk reservation policy,” IEEE Transactions on Communications, vol. 35, no. 3, pp. 313–318, 1987. View at Publisher · View at Google Scholar · View at Scopus
  5. L. Paratz, “Traffic theory of circuit reservation,” Australian Telecommunication Research, vol. 20, no. 2, pp. 51–60, 1986. View at Google Scholar · View at Scopus
  6. E. A. Van Doorn, “On the overflow process from a finite Markovian queue,” Performance Evaluation, vol. 4, no. 4, pp. 233–240, 1984. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. J. F. E. Wallin and B. Sanders, “The calculation of overflow moments in loss systems with selective trunk reservation,” Performance Evaluation, vol. 15, no. 3, pp. 195–202, 1992. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. J. P. Young, A queueing theory approach to the control of hospital in-patient census [Ph.D. dissertation], School of Engineering, The Johns Hopkins University, Baltimore, Md, USA, 1962.
  9. P. Kolesar, “A markovian model for hospital admission scheduling,” Management Science, vol. 16, no. 6, pp. 384–396, 1970. View at Publisher · View at Google Scholar · View at Scopus
  10. A. O. Esogbue and A. J. Singh, “A stochastic model for an optimal priority bed distribution problem in a hospital ward,” Operations Research, vol. 24, no. 5, pp. 884–898, 1976. View at Publisher · View at Google Scholar · View at Scopus
  11. E. P. C. Kao and G. G. Tung, “Bed allocation in a public health care delivery system,” Management Science, vol. 27, no. 5, pp. 507–520, 1981. View at Publisher · View at Google Scholar · View at Scopus
  12. L. V. Green and V. Nguyen, “Strategies for cutting hospital beds: the impact on patient service,” Health Services Research, vol. 36, no. 2, pp. 421–442, 2001. View at Google Scholar · View at Scopus
  13. J. K. Cochran and K. T. Roche, “A multi-class queuing network analysis methodology for improving hospital emergency department performance,” Computers & Operations Research, vol. 36, no. 5, pp. 1497–1512, 2009. View at Publisher · View at Google Scholar · View at Scopus
  14. W. Press, S. Teukolsky, W. Vetterling, and B. Flannery, Numerical Recipes in C: The Art of Scientific Computing, Cambridge University Press, Cambridge, UK, 1992.