Partially observable queueing systems with controlled service rates under a discounted optimality criterion

Yofre H. García; Saul Diaz-Infante; J. Adolfo Minjárez-Sosa

Displaying similar documents to “Partially observable queueing systems with controlled service rates under a discounted optimality criterion”

Analysis of an M|G|1|R queue with batch arrivals and two hysteretic overload control policies

Yuliya Gaidamaka, Alexander Pechinkin, Rostislav Razumchik, Konstantin Samouylov, Eduard Sopin (2014)

International Journal of Applied Mathematics and Computer Science

Similarity:

Hysteretic control of arrivals is one of the most easy-to-implement and effective solutions of overload problems occurring in SIP-servers. A mathematical model of an SIP server based on the queueing system $M^{[X]} | G | 1 ⟨ L, H ⟩ | ⟨ H, R ⟩$ with batch arrivals and two hysteretic loops is being analyzed. This paper proposes two analytical methods for studying performance characteristics related to the number of customers in the system. Two control policies defined by instants when it is decided to change the system’s...

Non-stationary departure process in a batch-arrival queue with finite buffer capacity and threshold-type control mechanism

Wojciech M. Kempa, Dariusz Kurzyk (2022)

Kybernetika

Similarity:

Non-stationary behavior of departure process in a finite-buffer $M^{X} / G / 1 / K$ -type queueing model with batch arrivals, in which a threshold-type waking up $N$ -policy is implemented, is studied. According to this policy, after each idle time a new busy period is being started with the $N$ th message occurrence, where the threshold value $N$ is fixed. Using the analytical approach based on the idea of an embedded Markov chain, integral equations, continuous total probability law, renewal theory and linear...

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

Approximate evaluation of continuous review $(R, Q)$ policies in two-echelon inventory systems with stochastic transportation times

Abdullah S. Karaman (2017)

Kybernetika

Similarity:

This paper considers a distribution inventory system that consists of a single warehouse and several retailers. Customer demand arrives at the retailers according to a continuous-time renewal process. Material flow between echelons is driven by reorder point/order quantity inventory control policies. Our objective in this setting is to calculate the long-run inventory, backorder and customer service levels. The challenge in this system is to characterize the demand arrival process at...

Optimal and analytical results of $M / E_{k} / 1 : \infty (F C F S)$ queueing model

Rakesh Kumar Verma (1982)

Kybernetika

Similarity:

Analysis of operating characteristics for the heterogeneous batch arrival queue with server startup and breakdowns

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

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this paper we consider a like-queue production system in which server startup and breakdowns are possible. The server is turned on (i.e. begins startup) when $N$ units are accumulated in the system and off when the system is empty. We model this system by an M $^{[x]}$ /M/1 queue with server breakdowns and startup time under the $N$ 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...

A paradox in a queueing network with state-dependent routing and loss.

Ziedins, Ilze (2007)

Journal of Applied Mathematics and Decision Sciences

Similarity:

Maximum likelihood estimates and confidence intervals of an M/M/R/N queue with balking and heterogeneous servers

Kuo-Hsiung Wang, Sheau-Chyi Chen, Jau-Chuan Ke (2004)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

This paper considers an M/M/R/N queue with heterogeneous servers in which customers balk (do not enter) with a constant probability $(1 - b)$ . We develop the maximum likelihood estimates of the parameters for the M/M/R/N queue with balking and heterogeneous servers. This is a generalization of the M/M/2 queue with heterogeneous servers (without balking), and the M/M/2/N queue with balking and heterogeneous servers in the literature. We also develop the confidence interval formula for the parameter...

The Optimal Control in Batch Arrival Queue With Server Vacations, Startup and Breakdowns

Jau-Chuan Ke (2004)

The Yugoslav Journal of Operations Research

Similarity:

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

Olga V. Semenova (2010)

RAIRO - Operations Research

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.