Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-24T02:33:01.836Z Has data issue: false hasContentIssue false

Convexity results for single-server queues and for multiserver queues with constant service times

Published online by Cambridge University Press:  14 July 2016

Arie Harel*
Affiliation:
Rutgers University
*
Postal address: Graduate School of Management, Rutgers University, 92 New Street. Newark, NJ 07102, USA.

Abstract

We show that the waiting time in queue and the sojourn time of every customer in the G/G/1 and G/D/c queue are jointly convex in mean interarrival time and mean service time, and also jointly convex in mean interarrival time and service rate. Counterexamples show that this need not be the case, for the GI/GI/c queue or for the D/GI/c queue, for c ≧ 2. Also, we show that the average number of customers in the M/D/c queue is jointly convex in arrival and service rates.

These results are surprising in light of the negative result for the GI/GI/2 queue (Weber (1983)).

Type
Short Communications
Copyright
Copyright © Applied Probability Trust 1990 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Harel, A. (1990) Convexity properties of the Erlang loss formula. Operat. Res. To appear.Google Scholar
Rolfe, A. J. (1971) A note on the marginal allocation in multi-server facilities. Management Sci. 17, 656658.Google Scholar
Tu, H. Y. and Kumin, H. (1983) A convexity result for a class of GI/G/1 queueing system. Operat. Res. 31, 948950.Google Scholar
Weber, R. R. (1983) A note on waiting times in single server queues. Operat. Res. 31, 950951.Google Scholar