A recursive method for the F-policy G/M/1/K queueing system with an exponential startup time

Kuo Hsiung Wang*, Ching Chang Kuo, W.l. Pearn

*此作品的通信作者

研究成果: Article同行評審

27 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)958-970
頁數13
期刊Applied Mathematical Modelling
32
發行號6
DOIs
出版狀態Published - 1 六月 2008

指紋

深入研究「A recursive method for the F-policy G/M/1/K queueing system with an exponential startup time」主題。共同形成了獨特的指紋。

引用此