The optimal batch size of M/D^N/1 queue
by Woojin Chang
International Journal of Operational Research (IJOR), Vol. 1, No. 4, 2006

Abstract: A single-server, infinite-capacity queue with Poisson input and deterministic bulk service rule is considered. The service time of a batch of a given size is a + b × N, where a is the common service time for all customers in a batch such as a set-up time, b is the individual service time for each customer, and N is the batch size. The queue is analysed using embedded Markov chain techniques. An explicit expression for the mean steady-state waiting time and an estimate of the optimal batch size minimising the mean steady-state waiting time are obtained. Our results are consistent with numerical computations.

Online publication date: Mon, 10-Jul-2006

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com