A recursive method for the F-policy G/M/1/K queueing system with an exponential startup time
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
970 | en_US |
dc.citation.issue |
6 | en_US |
dc.citation.spage |
958 | en_US |
dc.citation.volume |
32 | en_US |
dc.citation.woscount |
5 | |
dc.contributor.author |
Wang, Kuo-Hsiung | en_US |
dc.contributor.author |
Kuo, Ching-Chang | en_US |
dc.contributor.author |
Pearn, W. L. | en_US |
dc.contributor.department |
工業工程與管理學系 | zh_TW |
dc.contributor.department |
Department of Industrial Engineering and Management | en_US |
dc.date.accessioned |
2014-12-08T15:11:26Z | |
dc.date.available |
2014-12-08T15:11:26Z | |
dc.date.issued |
2008-06-01 | en_US |
dc.description.abstract |
This paper deals with the optimal control of a finite capacity G/M/1 queueing system combined the F-policy and an exponential startup time before start allowing customers in the system. The F-policy queueing problem investigates the most common issue of controlling arrival to a queueing system. We provide a recursive method, using the supplementary variable technique and treating the supplementary variable as the remaining interarrival time, to develop the steady-state probability distribution of the number of customers in the system. We illustrate a recursive method by presenting three simple examples for exponential, 3-stage Erlang, and deterministic interarrival time distributions, respectively. A cost model is developed to determine the optimal management F-policy at minimum cost. We use an efficient Maple computer program to determine the optimal operating F-policy and some system performance measures. Sensitivity analysis is also studied. (c) 2007 Elsevier Inc. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/j.apm.2007.02.023 | 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/j.apm.2007.02.023 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/8772 | |
dc.identifier.wosnumber |
WOS:000254447300003 | |
dc.language.iso |
en_US | en_US |
dc.subject |
F-policy | en_US |
dc.subject |
G/M/1/K queue | en_US |
dc.subject |
recursive method | en_US |
dc.subject |
server startup | en_US |
dc.subject |
supplementary variable | en_US |
dc.title |
A recursive method for the F-policy G/M/1/K queueing system with an exponential startup time | en_US |
dc.type |
Article | en_US |
檔案
- 000254447300003.pdf (193.1 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Wang, K.-H., Kuo, C.-C., & Pearn, W. L. (2008). A recursive method for the F-policy G/M/1/K queueing system with an exponential startup time. APPLIED MATHEMATICAL MODELLING, 32(6), 958–970. https://doi.org/10.1016/j.apm.2007.02.023
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/8772