Poisson input queueing system with startup time and under control-operating policy
Computers and Operations Research
Queueing systems with vacations—a survey
Queueing Systems: Theory and Applications
Control policies for the MX/g/1 queueing system
Management Science
A Poisson input queue under N-policy and with a general start up time
Computers and Operations Research
Batch arrival queue with N-policy and single vacation
Computers and Operations Research
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Optimal NT policies for M/G/1 system with a startup and unreliable server
Computers and Industrial Engineering
A note on workload control for an under-utilized server of M/G/1 system
Computers and Industrial Engineering
Grid resource management policies for load-balancing and energy-saving by vacation queuing theory
Computers and Electrical Engineering
Controlling arrival and service of a two-removable-server system using genetic algorithm
Expert Systems with Applications: An International Journal
Comparative analysis of a randomized N-policy queue: An improved maximum entropy method
Expert Systems with Applications: An International Journal
On the convexity of the two-threshold policy for an M/G/1 queue with vacations
Operations Research Letters
Hi-index | 0.01 |
This paper studies the control policy of the N policy M/G/1 queue with server vacations, startup and breakdowns, where arrivals form a Poisson process and service times are generally distributed. The server is turned off and takes a vacation whenever the system is empty. If the number of customers waiting in the system at the instant of a vacation completion is less than N, the server will take another vacation. If the server returns from a vacation and finds at least N customers in the system, he requires a startup time before providing service until the system is again empty. It is assumed that the server breaks down according to a Poisson process and his repair time has a general distribution. The system characteristics of such a model are analyzed and the total expected cost function per unit time is developed to determine the optimal threshold of N at a minimum cost.