Queue length and waiting time analysis of a batch arrival queue with bilevel control
Computers and Operations Research
On the M/G/1 Bernoulli feedback queue with multi-class customers
Computers and Operations Research
Tabu Search
Discrete-Time Models for Communication Systems Including ATM
Discrete-Time Models for Communication Systems Including ATM
An M/G/1 queue with multiple types of feedback, gated vacations and FCFS policy
Computers and Operations Research
Analysis and optimal control of a discrete-time queueing system under the (m,N)-policy
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
A discrete-time single-server queue with a modified N-policy
International Journal of Systems Science
| Hi-index | 0.98 |
This paper studies a Geo/G/1/~ queueing system under an (m,N)-policy, i.e., the service station operates under an N-policy with an early setup where the startup period begins when m(@?N) customers accumulate in the system. Moreover, it is assumed that the i-th service of each customer is either unsuccessful (and then the customer joins the server for another service) with probability @a"i or successful (and then the customer leaves the system forever) with complementary probability 1-@a"i. We give the joint generating function of the server state and the system length as well as the main performance measures. The distributions of the lengths of the idle, setup, standby and busy periods, as well as the distribution of the number of customers served during a busy period, are also derived. We define a total expected cost function and present a tabu search algorithm as a procedure to find out the optimal values in cases where the convexity is difficult to prove. Finally, the significance of the cost model is discussed through several numerical results.