Similar Search Results

Complete characterisation of the customer delay in a queueing system with batch arrivals and batch service

Claeys, Dieter; Laevens, Koenraad; Walraevens, Joris; … - In: Mathematical Methods of Operations Research 72 (2010) 1, pp. 1-23

occasionally been studied. The few papers concerning the customer delay share the common feature that only the moments are … capacity). In this paper, we aim for a complete characterisation—i.e., moments and tail probabilities - of the customer delay … on the moments and the tail probabilities of the customer delay. Copyright Springer-Verlag 2010 …

Persistent link: https://www.econbiz.de/10010999555

General batch service disciplines – A product-form batch processing network with customer coalescence

Peterson, Sonja - In: Mathematical Methods of Operations Research 52 (2000) 1, pp. 79-97

A new batch service discipline is introduced that allows for customers of different classes to leave together in one batch. This so-called general batch service discipline is discussed for servers with signals and class-independent or class-dependent exponential service times. The equilibrium...

Persistent link: https://www.econbiz.de/10010950202

Burst arrival queues with server vacations and random timers

Shomrony, Merav; Yechiali, Uri - In: Mathematical Methods of Operations Research 53 (2001) 1, pp. 117-146

We derive performance measures for burst arrival (e.g. messages of variable length packets) M <Superscript>K</Superscript>/G/1 queues with server vacations, controlled by the, so called, Randomly Timed Gated (RTG) protocol, operating as follows: Whenever the server returns from a (general-type) vacation and initiates a...</superscript>

Persistent link: https://www.econbiz.de/10010999581

Optimal strategy policy in batch arrival queue with server breakdowns and multiple vacations

Ke, Jau-Chuan - In: Mathematical Methods of Operations Research 58 (2003) 1, pp. 41-56

This paper considers a like-queue production system in which server vacations and breakdowns are possible. The decision-maker can turn a single server on at any arrival epoch or off at any service completion. We model the system by an M<Superscript>[x]</Superscript>/M/1 queueing system with N policy. The server can be...</superscript>

Persistent link: https://www.econbiz.de/10010999676

Structural results on a batch acceptance problem for capacitated queues

Çil, Eren; Örmeci, E.; Karaesmen, Fikri - In: Mathematical Methods of Operations Research 66 (2007) 2, pp. 263-274

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

Persistent link: https://www.econbiz.de/10010999893