Whereas the buffer content of batch-service queueing systems has been studied extensively, the customer delay has only occasionally been studied. The few papers concerning the customer delay share the common feature that only the moments are calculated explicitly. In addition, none of these...

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>

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>

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

We derive performance measures for burst arrival (e.g. messages of variable length packets) M K /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...

Whereas the buffer content of batch-service queueing systems has been studied extensively, the customer delay has only occasionally been studied. The few papers concerning the customer delay share the common feature that only the moments are calculated explicitly. In addition, none of these...

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 [x] /M/1 queueing system with N policy. The server can be...

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