STRONG CONVEXITY RESULTS FOR QUEUEING SYSTEMS.
Publication
, Journal Article
Harel, A; Zipkin, PH
Published in: Operations Research
1987
We prove a strong (and seemingly odd) result about the M/M/c queue: the reciprocal of the average sojourn time is a concave function of the traffic intensity. We use this result to show that the average itself is jointly convex in arrival and service rates. The standard deviation has the same properties. Also, we determine conditions under which these properties are exhibited by a standard approximation for the M/G/c queue. These results are useful in design studies for telecommunications and production systems.
Duke Scholars
Published In
Operations Research
Publication Date
1987
Volume
35
Issue
3
Start / End Page
405 / 418
Related Subject Headings
- Operations Research
- 3507 Strategy, management and organisational behaviour
- 1503 Business and Management
- 0802 Computation Theory and Mathematics
- 0102 Applied Mathematics
Citation
APA
Chicago
ICMJE
MLA
NLM
Harel, A., & Zipkin, P. H. (1987). STRONG CONVEXITY RESULTS FOR QUEUEING SYSTEMS. Operations Research, 35(3), 405–418.
Harel, A., and P. H. Zipkin. “STRONG CONVEXITY RESULTS FOR QUEUEING SYSTEMS.” Operations Research 35, no. 3 (1987): 405–18.
Harel A, Zipkin PH. STRONG CONVEXITY RESULTS FOR QUEUEING SYSTEMS. Operations Research. 1987;35(3):405–18.
Harel, A., and P. H. Zipkin. “STRONG CONVEXITY RESULTS FOR QUEUEING SYSTEMS.” Operations Research, vol. 35, no. 3, 1987, pp. 405–18.
Harel A, Zipkin PH. STRONG CONVEXITY RESULTS FOR QUEUEING SYSTEMS. Operations Research. 1987;35(3):405–418.
Published In
Operations Research
Publication Date
1987
Volume
35
Issue
3
Start / End Page
405 / 418
Related Subject Headings
- Operations Research
- 3507 Strategy, management and organisational behaviour
- 1503 Business and Management
- 0802 Computation Theory and Mathematics
- 0102 Applied Mathematics