Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 53, No. 3, May-June 2005, pp. 568-570
DOI: 10.1287/opre.1040.0173
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Fridgeirsdottir, K.
Right arrow Articles by Chiu, S.
Right arrow Search for Related Content

A Note on Convexity of the Expected Delay Cost in Single-Server Queues

Kristin Fridgeirsdottir, Sam Chiu

Decision Sciences, London Business School, Regent’s Park, London, NW1 4SA United Kingdom
Department of Management Science and Engineering, Stanford University, Stanford, California 94305

kristin{at}london.edu
samchiu{at}stanford.edu

In this note, we show that the expected delay cost for a G/G/1 queue is not necessarily convex in the arrival rate as sometimes claimed in the literature. We can prove, however, that the total expected delay cost rate is convex in the arrival rate. This cost rate is often of interest when designing queueing systems.

Subject classifications: mathematics:convexity; queues:optimization.
History: Received January 2004; revision received April 2004; accepted April 2004.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2005 by INFORMS.