Time-dependent solution and optimal control of a bulk service queue
Keyword(s):
We consider the queueing system denoted by M/MN /1/N where customers are served in batches of maximum size N. The model is motivated by a traffic application. The time-dependent probability distribution for the number of customers in the system is obtained in closed form. The solution is used to predict the optimal service rates during a finite time horizon.
2011 ◽
Vol 2
(4)
◽
pp. 75-88
Keyword(s):
1987 ◽
Vol 19
(1)
◽
pp. 202-218
◽
Keyword(s):
A new look at transient versions of Little's law, and M/G/1 preemptive last-come-first-served queues
2010 ◽
Vol 47
(2)
◽
pp. 459-473
◽
Keyword(s):
2005 ◽
Vol 22
(02)
◽
pp. 239-260
◽
A new look at transient versions of Little's law, and M/G/1 preemptive last-come-first-served queues
2010 ◽
Vol 47
(02)
◽
pp. 459-473
◽