The Interrelationship Between N-policy M/G/1/K and F-policy G/M/1/K Queues with Startup Time

檔案

本條目沒有附加檔案。

日期

2011-09-01

類型

期刊名稱

QUALITY TECHNOLOGY AND QUANTITATIVE MANAGEMENT

卷期與頁次

第 8 卷第 3 期,頁 237–251

ISSN

1684-3703

語言

英文

摘要

This paper studies the interrelationship between the N-policy M/G/1/K queue and the F-policy G/M/1/K queue. The N-policy queuing problem investigates the most common issue of controlling service. The F-policy queuing problem deals with the most common issue of controlling arrivals. We provide a recursive method, using the supplementary variable technique and treating the supplementary variable as the remaining service time, to develop the solution algorithm for the N-policy M/G/1/K queue with startup time. We have demonstrated that the N-policy M/G/1/K queue with startup time has been effectively used to derive the solution algorithm to the F-policy G/M/1/K queue with startup time. The interrelationship between the N-policy and the F-policy queueing problems are illustrated analytically for 3-stage Erlang (service or interarrival) time distribution.

所屬典藏

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

引用此條目

Kuo, C.-C., Wang, K.-H., & Pearn, W. L. (2011). The Interrelationship Between N-policy M/G/1/K and F-policy G/M/1/K Queues with Startup Time. QUALITY TECHNOLOGY AND QUANTITATIVE MANAGEMENT, 8(3), 237–251. https://ir.lib.nycu.edu.tw/handle/11536/19603

BibTeX RIS

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

分享

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