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

Kristin Fridgeirsdottir () and Sam Chiu ()
Additional contact information
Kristin Fridgeirsdottir: Decision Sciences, London Business School, Regent’s Park, London, NW1 4SA United Kingdom
Sam Chiu: Department of Management Science and Engineering, Stanford University, Stanford, California 94305

Operations Research, 2005, vol. 53, issue 3, 568-570

Abstract: 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.

Keywords: mathematics:convexity; queues:optimization (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1040.0173 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:53:y:2005:i:3:p:568-570

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().