In this paper, a versatile Markovian queueing system is considered. Given a fixed threshold level c, the server serves customers one a time when the queue length is less than c, and in batches of fixed size c when the queue length is greater than or...
This paper analyzes a finite-capacity Markovian queueing system with two customer types, each assigned to a separate buffer, and a single alternating server whose service priority is dynamically controlled by a queue-length-based threshold policy. Th...
This manuscript starts with a detailed analysis of the current solution for the queueing system M/Er/1/∞. In the existing solution, Erlang’s service is caused by Poisson’s arrival process of groups, but not individual clients. The s...
A flexible single-server queueing system is considered in this paper. The server adapts to the system size by using a strategy where the service provided can be either single or bulk depending on some threshold level c. If the number of customers in...
The use of a Markovian inventory system is a critical part of inventory management. The purpose of this study is to examine the demand for two commodities in a Markovian inventory system, one of which is designated as a major item (Commodity-I) and t...
Analysis of a crowdsourcing Markovian queue with phase-type service is considered in this paper. In this model, a customer not only receives service but also assists in delivery. In other words, in a retail environment, while some customers shop in-s...
A non-zero correlation between service times can be encountered in many real queueing systems. An attractive model for correlated service times is the Markovian service process, because it offers powerful fitting capabilities combined with analytical...
In this paper, a class of queueing models with impatient customers is considered. It deals with the probability characteristics of an individual customer in a non-stationary Markovian queue with impatient customers, the stationary analogue of which w...
We study waiting times in a queue with active management and correlated job/packet sizes, which induce correlated service times. In the transient case, formulae for the distribution tail, the probability density, and the expected virtual waiting time...
In this paper, we present the results of a study of a priority multi-server queuing system with heterogeneous customers arriving according to a marked Markovian arrival process (MMAP), phase-type service times (PH), and a queue with finite capacity....
In this paper, we discuss a non-Markovian batch arrival general bulk service single-server queueing system with server breakdown and repair, a stand-by server, multiple vacation and re-service. The main server’s regular service time, re-service...
Queueing models have proven to be very useful in real-life applications to enable the practitioners to optimize the limited resources to conduct their businesses as well as offer services efficiently. In general, we can group such applications into t...
This paper studies a Markovian queue with multiple working vacations and controlled vacation interruption. If there are at least N customers waiting upon completion of a service at a lower rate, the vacation is interrupted and the server returns to t...
In this paper, we consider two single server queueing systems to which customers of two distinct priorities (
In this paper, we analyze a multi-server queueing system with heterogeneous customers that arrive according to a marked Markovian arrival process. Customers of two types differ in priorities and parameters of phase type distribution of their service...
This study focuses on forecasting and optimizing the performance of a real-world object modelled by a multi-server queueing system that processes two types of users: primary (new) users and repeating users. The repeating users are those who succeeded...
In this paper, we study a multi-server queueing system with retrials and an infinite orbit. The arrival of primary customers is described by a batch Markovian arrival process (
We consider a queueing network with a finite number of nodes and servers moving between the nodes as a model of car sharing. The arrival process of customers to various nodes is defined by a marked Markovian arrival process. The customer that arrives...
The imbalanced distribution of shared bikes in the dockless bike-sharing system (a typical example of the resource-sharing system), which may lead to potential customer churn and lost profit, gradually becomes a vital problem for bike-sharing firms a...
This article discusses the queueing-inventory model with a cancellation policy and two classes of customers. The two classes of customers are named ordinary and impulse customers. A customer who does not plan to buy the product when entering the syst...
This study examines a single-server Markovian queueing system featuring continuous service and an infinite number of customers at both ends—namely, offline and online clients. Offline customers are conventional clients who arrive at the system...
We consider a non-standard class of Markovian time: varying infinite capacity queues with possibly heterogeneous servers and impatience. We assume that during service time, a customer may switch to the faster server (with no delay), when such a serve...
This work considers a preemptive priority queueing system with vacation, where the single server may break down with imperfect coverage. Various combinations of server vacation priority queueing models have been studied by many scholars. A common ass...
Consideration is given to the nonstationary analogue of
This paper is largely a review. It considers two main methods used to study stability and to obtain appropriate quantitative estimates of perturbations of (inhomogeneous) Markov chains with continuous time and a finite or countable state space. An ap...
Degradation of services arises in practice due to a variety of reasons including wear-and-tear of machinery and fatigue. In this paper, we look at
The model discussed in this paper provides an efficient mechanism for the selection and allocation of available limited spectra for transmission of heterogeneous data in a network. The data packets (customers), belonging to different classes, arrive...
The problem considered is the computation of the (limiting) time-dependent performance characteristics of one-dimensional continuous-time Markov chains with discrete state space and time varying intensities. Numerical solution techniques can benefit...
In this paper, we study a Markovian queuing system consisting of two subsystems of an arbitrary structure. Each subsystem generates a multi-class Markovian arrival process of customers arriving to the other subsystem. We derive the necessary and suff...
Hawkes processes are a class of self-exciting point processes with a clustering effect whose jump rate is determined by its past history. They are generally regarded as continuous-time processes and have been widely applied in a number of fields, suc...
In non-Markovian tandem queueing networks the output process of one site, which is the input process to the next site, is not renewal. Consequently, the correlation analysis of that output processes is essential when studying such networks. A correla...
In this research, we look at the work associated with the encouraged arrival line with feedback, balking and maintaining reneged clients. We analyse the quality control policy for the Markovian model using an iterative method to the nth customer in t...
This paper investigates the concept of a Markovian queueing model with heterogeneous, intermittently available servers with feedback under a hybrid vacation policy. Both the asymmetric transition representation and the hybrid vacation policy are addr...
In this paper, we consider a single server queueing system in which the arrivals occur according to a Markovian arrival process (MAP). The served customers may be recruited (or opted from those customers’ point of view) to act as secondary servers to...
Queueing models with disasters can be used to evaluate the impact of a breakdown or a system reset in a service facility. In this paper, we consider a discrete-time single-server queueing system with general independent arrivals and general independe...
This article focuses on both classical and Bayesian inference of traffic intensity in a single-server Markovian queueing model considering balking. To reflect real-world situations, the article introduces the concept of balking, where customers opt n...
The problem of optimal scheduling in a system with parallel queues and a single server has been extensively studied in queueing theory. However, such systems have mostly been analysed by assuming homogeneous attributes of arrival and service processe...
We present a comprehensive numerical approach with reasonably light complexity in terms of implementation and computation for assessing the performance of hybrid make-to-stock (MTS)/make-to-order (MTO) systems. In such hybrid systems, semi-finished p...
Designing the crossroads capacity is a prerequisite for achieving a high level of service with the same sustainability in stochastic traffic flow. Also, modeling of crossroad capacity can influence on balancing (symmetry) of traffic flow. Loss of pri...
Abstract: Queueing networks are used to model the performance of the Internet, of manufacturing and job-shop systems, supply chains, and other networked systems in transportation or emergency management. Composed of service stations where customers r...
The Hawkes process, which is generally defined for the continuous-time setting, can be described as a self-exciting simple point process with a clustering effect, whose jump rate depends on its entire history. Due to past events determining future de...
The mathematical framework presented in this article focuses on the controlled-transmission protocol’s asynchronous process of bandwidth allocation for the target virtual connection implemented under competition for communication resources. The...
The paper presents a Markovian queueing model for assessing the performance of synchronisation between stations in a production system. The system at hand consists of K distinct buffers, each buffer storing an item that is needed for the next product...
Heterogeneous systems of limited capacity have general applications in manufacturing, but also in logistic or service systems due to the differences in server or workstation performance or work assignment; this is in close relationship with system fl...
We discuss two queueing-inventory systems with catastrophes in the warehouse. Catastrophes occur according to the Poisson process and instantly destroy all items in the inventory. The arrivals of the consumer customers follow a Markovian arrival proc...
This paper proposes a real-time chain and a novel embedded Markovian queueing model with variable bulk arrival (VBA) and variable bulk service (VBS) in order to establish and assure a theoretical foundation to design a blockchain-based real-time syst...
In this paper, we consider a queueing system consisting of two multi-server subsystems that is designed for the service of clients arriving at a system according to a Markovian arrival process (MAP). Arriving clients receive information about the num...
This research analyses the performance of a perishable queueing-inventory system for two commodities with optional customers demands. We assume in the article that all customers who come to the system can only purchase the first item or the second it...
The present study deals with the stock-dependent Markovian demand of a retrial queueing system with a single server and multiple server vacation. The items are restocked under a continuous review
We consider a queueing inventory with one essential and m optional items for sale. The system evolves in environments that change randomly. There are n environments that appear in a random fashion governed by a Marked Markovian Environment change pro...
of 2