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.
机构:
Dept. of Indust. Eng. and Eng. Mgmt., Hong Kong Univ. of Sci. and Technol., Hong Kong, Hong Kong
Fac. of Comm. and Bus. Admin., University of British Columbia, Vancouver, BC V6T 1Z2, CanadaDept. of Indust. Eng. and Eng. Mgmt., Hong Kong Univ. of Sci. and Technol., Hong Kong, Hong Kong
Chen, Hong
Kella, Offer
论文数: 0引用数: 0
h-index: 0
机构:
Department of Statistics, The Hebrew University of Jerusalem, Mount Scopus, Jerusalem 91905, IsraelDept. of Indust. Eng. and Eng. Mgmt., Hong Kong Univ. of Sci. and Technol., Hong Kong, Hong Kong
Kella, Offer
Weiss, Gideon
论文数: 0引用数: 0
h-index: 0
机构:
Department of Statistics, University of Haifa, Haifa 31905, IsraelDept. of Indust. Eng. and Eng. Mgmt., Hong Kong Univ. of Sci. and Technol., Hong Kong, Hong Kong
机构:
Hong Kong Univ Sci & Technol, Dept Ind Engn & Engn Management, Kowloon, Hong KongHong Kong Univ Sci & Technol, Dept Ind Engn & Engn Management, Kowloon, Hong Kong
Chen, H
Kella, O
论文数: 0引用数: 0
h-index: 0
机构:Hong Kong Univ Sci & Technol, Dept Ind Engn & Engn Management, Kowloon, Hong Kong
Kella, O
Weiss, G
论文数: 0引用数: 0
h-index: 0
机构:Hong Kong Univ Sci & Technol, Dept Ind Engn & Engn Management, Kowloon, Hong Kong