Optimal control and performance analysis of an MX/M/1 queue with
batches  of negative customers

Jesus R. Artalejo; Antonis Economou

The search session has expired. Please query the service again.

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

Analysis of Operating Characteristics for the Heterogeneous Batch Arrival Queue with Server Startup and Breakdowns

Jau-Chuan Ke, Kuo-Hsiung Wang (2010)

RAIRO - Operations Research

Similarity:

In this paper we consider a like-queue production system in which server startup and breakdowns are possible. The server is turned on ( begins startup) when units are accumulated in the system and off when the system is empty. We model this system by an M/M/1 queue with server breakdowns and startup time under the policy. The arrival rate varies according to the server's status: off, startup, busy, or breakdown. While the server is working, he is subject to breakdowns according to...

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/G/1 queue with two service modes.

Dudin, Alexander N., Nishimura, Shoichi (1999)

Mathematical Problems in Engineering

Similarity:

On some queue length controlled stochastic processes.

Abolnikov, Lev, Dshalalow, Jewgeni H., Dukhovny, Alexander M. (1990)

Journal of Applied Mathematics and Stochastic Analysis

Similarity:

Optimal hysteretic control for a $BMAP/SM/1/ N$ queue with two operation modes.

Dudin, Alexander N., Nishimura, Shoichi (2000)

Mathematical Problems in Engineering

Similarity:

Enhanced stochastic methodology for combined architecture of E-commerce and security networks.

Kim, Song-Kyoo (2009)

Mathematical Problems in Engineering

Similarity:

Effective utilization of idle time in an $(s, S)$ inventory with positive service time.

Krishnamoorthy, A., Deepak, T.G., Narayanan, Viswanath C., Vineetha, K. (2006)

Journal of Applied Mathematics and Stochastic Analysis

Similarity:

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.

A queueing system with a fixed accumulation level, random server capacity and capacity dependent service time.

Dshalalow, Jewgeni H., Tadj, Lotfi (1992)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Admission controls for Erlang's loss system with service times distributed as a finite sum of exponential random variables.

Moretta, Brian, Ziedins, Ilze (1998)

Journal of Applied Mathematics and Decision Sciences

Similarity:

Multi-threshold control of the $B M A P / S M / 1 / K$ queue with group services.

Dudin, Alexander N., Chakravarthy, Srinivas R. (2003)

Journal of Applied Mathematics and Stochastic Analysis

Similarity:

Transient and stationary characteristics of a packet buffer modelled as an map/sm/1/b system

Krzysztof Rusek, Lucjan Janowski, Zdzisław Papir (2014)

International Journal of Applied Mathematics and Computer Science

Similarity:

Optimal QoS control of interacting service stations

Abdelkrim Haqiq, I. Lambadaris, N. Mikou, L. Orozco–Barbosa (2010)

RAIRO - Operations Research

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