A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
CONCAVITY OF THE CONDITIONAL MEAN SOJOURN TIME IN THE PROCESSOR-SHARING QUEUE WITH BATCH ARRIVALS
2010
Bulletin of the Korean Mathematical Society
Preserved Fulltext
For an M/G/1 processor-sharing queue with batch arrivals, Avrachenkov et al. [1] conjectured that the conditional mean sojourn time is concave. However, Kim and Kim [5] showed that this conjecture is not true in general. In this paper, we show that this conjecture is true if the service times have a hyperexponential distribution.
doi:10.4134/bkms.2010.47.6.1251
fatcat:ulochwskrnaozkuwl2wnlvszlu