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

Samuli Aalto

Mathematical Methods of Operations Research, 1998, vol. 48, issue 3, 317-335

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. Copyright Springer-Verlag Berlin Heidelberg 1998

Keywords: Key words: Optimal control; batch service queue; finite service capacity (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860050030 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:48:y:1998:i:3:p:317-335

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860050030

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().