Maximum entropy analysis to the N policy M/G/1 queueing system with a removable server
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
1162 | en_US |
dc.citation.issue |
12 | en_US |
dc.citation.spage |
1151 | en_US |
dc.citation.volume |
26 | en_US |
dc.citation.woscount |
10 | |
dc.contributor.author |
Wang, KH | en_US |
dc.contributor.author |
Chuang, SL | 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:41:41Z | |
dc.date.available |
2014-12-08T15:41:41Z | |
dc.date.issued |
2002-12-01 | en_US |
dc.description.abstract |
We study a single removable server in an M/G/1 queueing system operating under the N policy in steady-state. The server may be turned on at arrival epochs or off at departure epochs. Using the maximum entropy principle with several well-known constraint, we develop the approximate formulae for the probability distributions of the number of customers and the expected waiting time in the queue. We perform a comparative analysis between the approximate results with exact analytic results for three different service time distributions, exponential, 2-stage Erlang, and 2-stage hyper-exponential, The maximum entropy approximation approach is accurate enough for practical purposes. We demonstrate, through the maximum entropy principle results, that the N policy M/G/1 queueing system is sufficiently robust to the variations of service time distribution functions. (C) 2002 Elsevier Science Inc. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/S0307-904X(02)00056-2 | en_US |
dc.identifier.issn |
0307-904X | en_US |
dc.identifier.journal |
APPLIED MATHEMATICAL MODELLING | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/S0307-904X(02)00056-2 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/28345 | |
dc.identifier.wosnumber |
WOS:000179298100004 | |
dc.language.iso |
en_US | en_US |
dc.subject |
control | en_US |
dc.subject |
maximum entropy | en_US |
dc.subject |
Lagrange's method | en_US |
dc.subject |
M/G/1 queue | en_US |
dc.title |
Maximum entropy analysis to the N policy M/G/1 queueing system with a removable server | en_US |
dc.type |
Article | en_US |
檔案
- 000179298100004.pdf (106.2 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Wang, K., Chuang, S., & Pearn, W. (2002). Maximum entropy analysis to the N policy M/G/1 queueing system with a removable server. APPLIED MATHEMATICAL MODELLING, 26(12), 1151–1162. https://doi.org/10.1016/S0307-904X(02)00056-2
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/28345