Optimal Control of the Vacation Scheme in an M/G/1 Queue
نویسندگان
چکیده
منابع مشابه
Bat Algorithm for Optimal Service Parameters in an Impatient Customer N-Policy Vacation Queue
In this paper, a meta-heuristic method, the Bat Algorithm, based on the echolocation behavior of bats is used to determine the optimum service rate of a queue problem. A finite buffer M/M/1 queue with N policy, multiple working vacations and Bernoulli schedule vacation interruption is considered. Under the two customers' impatient situations, balking and reneging, the...
متن کاملdevelopment and implementation of an optimized control strategy for induction machine in an electric vehicle
in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...
15 صفحه اولAdmission Control of Bulk Retrial Queue under Bernoulli Vacation Schedule
This paper examines the Bernoulli admission control policy for the two phase bulk arrival retrial queueing system wherein the customers has the option either to take second phase of service or to leave the system after completing first essential phase of service. In addition, the arrival rate of the customers depends upon the server status. After the service completion of each individual custom...
متن کاملThe Bm Ap=g=1 Vacation Queue with Queue–length Dependent Vacation Schedule
We treat a single–server vacation queue with queue–length dependent vacation schedules. This subsumes the single–server vacation queue with exhaustive service discipline and the vacation queue with Bernoulli schedule as special cases. The lengths of vacation times depend on the number of customers in the system at the beginning of a vacation. The arrival process is a batch–Markovian arrival pro...
متن کاملOptimal Two-Threshold Policies in an M/G/1 Queue With Two Vacation Types
This paper treats two-threshold policies for an M/G/1 queue with two types of generally distributed random vacations: type 1 (long) and type 2 (short) vacations. Upon returning from a vacation, the server observes the queue length. If this is less than the lower threshold, the server takes a type 1 vacation; if it is between the two thresholds, the server takes a type 2 vacation; and if it is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1990
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.38.4.724