Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Concavity of the conditional mean sojourn time in the M/G/1 processor-sharing queue with batch arrivals
- Authors
- Kim, Jeongsim; Kim, Bara
- Issue Date
- 1월-2008
- Publisher
- SPRINGER
- Keywords
- processor-sharing; batch arrivals; sojourn time; concavity
- Citation
- QUEUEING SYSTEMS, v.58, no.1, pp.57 - 64
- Indexed
- SCIE
SCOPUS
- Journal Title
- QUEUEING SYSTEMS
- Volume
- 58
- Number
- 1
- Start Page
- 57
- End Page
- 64
- ISSN
- 0257-0130
- Abstract
- Avrachenkov et al. (Queueing Syst. 50:459-480, [2005]) conjectured that in an M/G/1 processor-sharing queue with batch arrivals, the conditional mean sojourn time is concave. In this paper, we show that this conjecture is generally not true.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Science > Department of Mathematics > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.