Skip to main content
Log in

Optimal control of batch service queues with compound Poisson arrivals and finite service capacity

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract.

We consider the optimal control problem of an M X/G(Q)/1 batch service queueing system with Q<∞. So, we assume that customers arrive according to a compound Poisson process and are served in batches not greater than the finite service capacity Q. The control problem involves the determination of the epochs at which the service is initiated as well as the sizes of the batches served. We introduce a new class of operating policies and prove that, under some additional assumptions, there is an optimal operating policy belonging to this new class.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received June 1997/Revised version November 1997

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aalto, S. Optimal control of batch service queues with compound Poisson arrivals and finite service capacity. Mathematical Methods of OR 48, 317–335 (1998). https://doi.org/10.1007/s001860050030

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001860050030

Navigation