Journal Published Online: 10 October 2014
Volume 43, Issue 5

Maximum Entropy Analysis to the Policy M/G/1 Queue with Working Breakdowns

CODEN: JTEVAB

Abstract

This paper deals with the N policy M/G/1 queue with working breakdowns. In this queueing system, the steady-state probabilities cannot be derived explicitly. Thus, we employ a maximum entropy approach with several constraints to develop the approximate formulae for the steady-state probability distributions of queue length and the expected waiting time in the queue. We perform a comparative analysis between the approximate results with established exact results for different service time distributions, such as exponential, two-stage Erlang, two-stage hyper-exponential, and deterministic. Numerical results demonstrate that the maximum entropy approach is quite accurate for practical purposes and is useful for complex queueing-systems solving.

Author Information

Chen, Jia-Yu
Dept. of Applied Mathematics, National Chung-Hsing Univ., Taichung, TW
Wang, Kuo-Hsiung
Dept. of Computer Science and Information Management, Providence Univ., Taichung, TW
Sheu, Shin-Pyng
Dept. of Applied Mathematics, National Chung-Hsing Univ., Taichung, TW
Chou, Wen-Kuang
Dept. of Computer Science and Information Management, Providence Univ., Taichung, TW
Pages: 10
Price: $25.00
Related
Reprints and Permissions
Reprints and copyright permissions can be requested through the
Copyright Clearance Center
Details
Stock #: JTE20130270
ISSN: 0090-3973
DOI: 10.1520/JTE20130270