Maximum entropy analysis to the N policy M/G/1 queueing system with server breakdowns and general startup times
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
61 | en_US |
dc.citation.issue |
1 | en_US |
dc.citation.spage |
45 | en_US |
dc.citation.volume |
165 | en_US |
dc.citation.woscount |
8 | |
dc.contributor.author |
Wang, KH | en_US |
dc.contributor.author |
Wang, TY | en_US |
dc.contributor.author |
Pearn, WL | en_US |
dc.contributor.department |
工業工程與管理學系 | zh_TW |
dc.contributor.department |
Department of Industrial Engineering and Management | en_US |
dc.date.accessioned |
2014-12-08T15:18:52Z | |
dc.date.available |
2014-12-08T15:18:52Z | |
dc.date.issued |
2005-06-06 | en_US |
dc.description.abstract |
We study a single removable and unreliable server in the N policy M/G/1 queueing system with general startup times where arrivals form a Poisson process and service times are generally distributed. When N customers are accumulated in the system, the server is immediately turned on but is temporarily unavailable to the waiting customers. He needs a startup time before providing service until the system becomes empty. The server is subject to breakdowns according to a Poisson process and his repair time obeys an arbitrary distribution. We use maximum entropy principle to derive the approximate formulas for the steady-state probability distributions of the queue length. We perform a comparative analysis between the approximate results with established exact results for various distributions, such as exponential (M), fc-stage Erlang (E-k), and deterministic (D). We demonstrate that the maximum entropy approach is accurate enough for practical purposes and is a useful method for solving complex queueing systems. (c) 2004 Published by Elsevier Inc. | en_US |
dc.identifier.doi |
10.1016/j.amc.2004.04.115 | en_US |
dc.identifier.issn |
0096-3003 | en_US |
dc.identifier.journal |
APPLIED MATHEMATICS AND COMPUTATION | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/j.amc.2004.04.115 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/13583 | |
dc.identifier.wosnumber |
WOS:000229221400006 | |
dc.language.iso |
en_US | en_US |
dc.subject |
control | en_US |
dc.subject |
Lagrange's method | en_US |
dc.subject |
maximum entropy | en_US |
dc.subject |
M/G/1 queue | en_US |
dc.subject |
startup | en_US |
dc.subject |
unreliable server | en_US |
dc.title |
Maximum entropy analysis to the N policy M/G/1 queueing system with server breakdowns and general startup times | en_US |
dc.type |
Article | en_US |
檔案
- 000229221400006.pdf (242.3 KB, Adobe PDF)
所屬典藏: 期刊論文