Displaying similar documents to “Optimal control and performance analysis of an M X / M / 1 queue with batches of negative customers”

Optimal control and performance analysis of an queue with batches of negative customers

Jesus R. Artalejo, Antonis Economou (2010)

RAIRO - Operations Research

Similarity:

We consider a Markov decision process for an queue that is controlled by batches of negative customers. More specifically, we derive conditions that imply threshold-type optimal policies, under either the total discounted cost criterion or the average cost criterion. The performance analysis of the model when it operates under a given threshold-type policy is also studied. We prove a stability condition and a complete stochastic comparison characterization for models operating under different...

Contrôle dynamique de flux dans un système d'attente avec panne

A. Haqiq, N. Mikou (2010)

RAIRO - Operations Research

Similarity:

We consider two parallel M/M/1 queues. The server at one of the queues is subject to intermittent breakdowns. By the theory of dynamic programming, we determine a threshold optimal policy which consists to transfer, when it is necessary, the customers that arrive at the first queue towards the second queue in order to minimize an instantaneous cost depending of the two queue lengths.

Optimal control for a BMAP/SM/1 queue with MAP-input of disasters and two operation modes

Olga V. Semenova (2004)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

A single-server queueing system with a batch markovian arrival process (BMAP) and MAP-input of disasters causing all customers to leave the system instantaneously is considered. The system has two operation modes, which depend on the current queue length. The embedded and arbitrary time stationary queue length distribution has been derived and the optimal control threshold strategy has been determined.

Optimal QoS control of interacting service stations

Abdelkrim Haqiq, I. Lambadaris, N. Mikou, L. Orozco-Barbosa (2002)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

We consider a system of three queues and two types of packets. Each packet arriving at this system finds in front of it a controller who either sends it in the first queue or rejects it according to a QoS criterion. When the packet finishes its service in the first queue, it is probabilistically routed to one of two other parallel queues. The objective is to minimize a QoS discounted cost over an infinite horizon. The cost function is composed of a waiting cost per packet in each queue...