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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

27 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)958-970
Number of pages13
JournalApplied Mathematical Modelling
Volume32
Issue number6
DOIs
StatePublished - 1 Jun 2008

Keywords

  • F-Policy
  • G/M/1/K queue
  • Recursive method
  • Server startup
  • Supplementary variable

Fingerprint Dive into the research topics of 'A recursive method for the F-policy G/M/1/K queueing system with an exponential startup time'. Together they form a unique fingerprint.

Cite this