Structural results on a batch acceptance problem for capacitated queues

Eren Çil (), E. Örmeci () and Fikri Karaesmen ()

Mathematical Methods of Operations Research, 2007, vol. 66, issue 2, 263-274

Abstract: The purpose of this paper is to investigate the structural properties of the optimal batch acceptance policy in a Markovian queueing system where different classes of customers arrive in batches and the buffer capacity is finite. We prove that the optimal policy can possess certain monotonicity properties under the assumptions of a single-server and constant batch sizes. Even though our proof cannot be extended to cases where either one of the assumptions is relaxed, we numerically observe that the optimal policy can still possess the same properties when only the single-server assumption is relaxed. Finally, we present counterexamples that show the non-monotone structure of the optimal policy when the batch sizes are not constant. Copyright Springer-Verlag 2007

Keywords: Queueing theory; Dynamic programming; Admission policy; Batch arrivals (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1007/s00186-006-0137-6 (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:66:y:2007:i:2:p:263-274

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

DOI: 10.1007/s00186-006-0137-6

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 ().