Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics and Decision Sciences
Volume 2006, Article ID 87514, 13 pages
http://dx.doi.org/10.1155/JAMDS/2006/87514

A simulation framework for networked queue models: Analysis of queue bounds in a G/G/c supply chain

1The RAND Corporation , Santa Monica 90407-2138, CA, USA
2College of Engineering, California State University, Long Beach 90840, CA, USA
3Information Systems Department, California State University, Long Beach 90840, CA, USA

Received 4 April 2006; Accepted 18 May 2006

Copyright © 2006 Mahyar Amouzegar and Khosrow Moshirvaziri. 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. Amouzegar, L. S. Galway, and A. Geller, “Supporting expeditionary aerospace forces: an analysis of jet engine intermediate maintenance options,” Tech. Rep. MR-1431-AF, RAND, California, 2001. View at Google Scholar
  2. S. L. Brumelle, “Some inequalities for parallel-server queues,” Operations Research, vol. 19, pp. 402–413, 1971. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. B. Diamond, S. Lamperti, D. Krahl, and A. Nastasi, “Extend v6 User's Guide,” 2002. View at Google Scholar
  4. D. Gross and C. M. Harris, Fundamentals of Queueing Theory, Wiley Series in Probability and Statistics: Texts and References Section, John Wiley & Sons, New York, 3rd edition, 1998. View at Zentralblatt MATH · View at MathSciNet
  5. J. F. C. Kingman, “On queues in heavy traffic,” Journal of the Royal Statistical Society. Series B. Methodological, vol. 24, pp. 383–392, 1962. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. L. Köllerström, “Heavy traffic theory for queues with several servers: I,” Journal of Applied Probability, vol. 11, pp. 544–552, 1974. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. R. Larson and A. Odoni, Urban Operations Research, Prentice-Hall, New Jersey, 1981.
  8. W. G. Marchal, “Some simpler bounds on the mean queuing time,” Operations Research, vol. 26, no. 6, pp. 1083–1088, 1978. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. K. T. Marshall, “Some inequalities in queuing,” Operations Research, vol. 16, pp. 651–665, 1968. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet