A recursive method for the F-policy G/M/1/K queueing system with an exponential startup time
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 p...
Gespeichert in:
Veröffentlicht in: | Applied mathematical modelling 2008-06, Vol.32 (6), p.958-970 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
ISSN: | 0307-904X |
DOI: | 10.1016/j.apm.2007.02.023 |