Browsing by Author "Kuo, Ching-Chang"

Now showing 1 - 2 of 2

A recursive method for the F-policy G/M/1/K queueing system with an exponential startup time
(2008-06-01)
Wang, Kuo-Hsiung
;
Kuo, Ching-Chang
;
Pearn, W. L.
;
工業工程與管理學系
;
Department of Industrial Engineering and Management
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.
The Interrelationship Between N-policy M/G/1/K and F-policy G/M/1/K Queues with Startup Time
(2011-09-01)
Kuo, Ching-Chang
;
Wang, Kuo-Hsiung
;
Pearn, W. L.
;
工業工程與管理學系
;
Department of Industrial Engineering and Management
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.