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

檔案

日期

2008-06-01

類型

期刊名稱

APPLIED MATHEMATICAL MODELLING

卷期與頁次

第 32 卷第 6 期,頁 958–970

ISSN

0307-904X

語言

英文

摘要

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

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

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/8772