کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1705794 1012441 2008 13 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A recursive method for the F-policy G/M/1/K queueing system with an exponential startup time
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی مکانیک محاسباتی
پیش نمایش صفحه اول مقاله
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 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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematical Modelling - Volume 32, Issue 6, June 2008, Pages 958–970
نویسندگان
, , ,