Related papers: Matching Queues with Reneging: a Product Form Solu…
Stochastic comparisons of series and parallel systems are important in many areas of engineering, operations research and reliability analysis. These comparisons allow for the evaluation of the performance and reliability of systems under…
We study the problem of matching agents who arrive at a marketplace over time and leave after d time periods. Agents can only be matched while they are present in the marketplace. Each pair of agents can yield a different match value, and…
In this article, we consider a continuous review (s, S) inventory system with failures of demand fulfillment (service) modeled as a Markov-modulated retrial queueing system. The inventory system features a single product that experiences…
In this paper, we consider a new queueing model where queues balance themselves according to a mean field interaction with a time delay. Unlike other work with delayed information our model considers multi-server queues with customer…
A simple analytical solution is proposed for the stationary loss system of two parallel queues with finite capacity $K$, in which new customers join the shortest queue, or one of the two with equal probability if their lengths are equal.…
We consider the problem faced by a service platform that needs to match limited supply with demand but also to learn the attributes of new users in order to match them better in the future. We introduce a benchmark model with heterogeneous…
We consider multi-class single-server queueing networks that have a product form stationary distribution. A new limit result proves a sequence of such networks converges weakly to a stochastic flow level model. The stochastic flow level…
Obtaining estimates of the convergence rate of the regenerating process $Q(t)$ whose value at time $t$ is equal to the number of claims in the system $ M \backslash G \backslash \infty $ at this moment, to the limit (stationary) regime.
A fluid queuing network constitutes one of the simplest models in which to study flow dynamics over a network. In this model we have a single source-sink pair and each link has a per-time-unit capacity and a transit time. A dynamic…
We investigate an M/M/1 queue operating in two switching environments, where the switch is governed by a two-state time-homogeneous Markov chain. This model allows to describe a system that is subject to regular operating phases alternating…
We develop methods for simulating a queue with an autoregressive net-input process and for recovering characteristics of such a net-input process from samples of queue lengths. We apply these methods to the problem of estimating the…
We consider an M/M/1 queueing model where customers can strategically decide to enter or leave the queue. We characterize the class of queueing regimes such that, for any parameters of the model, the socially efficient behavior is an…
We study a token-based central queue with multiple customer types. Customers of each type arrive according to a Poisson process and have an associated set of compatible tokens. Customers may only receive service when they have claimed a…
Intermittent demand forecasting is a ubiquitous and challenging problem in production systems and supply chain management. In recent years, there has been a growing focus on developing forecasting approaches for intermittent demand from…
We introduce a simple benchmark model of dynamic matching in networked markets, where agents arrive and depart stochastically and the network of acceptable transactions among agents forms a random graph. We analyze our model from three…
We consider the queuing networks, which are made from servers, exchanging their positions. The customers, using the network, try to reach their destinations, which is complicated by the movements of the servers, taking their customers with…
These days enterprise applications try to integrate online processing and batch jobs into a common software stack for seamless monitoring and driverless operations. Continuous integration of these systems results in choking of the poorly…
In this paper we analyze the average queue backlog in a combined input-output queued switch using a maximal size matching scheduling algorithm. We compare this average backlog to the average backlog achieved by an optimal switch. We model…
This paper presents an inventory model for imperfect quality items with receiving a reparative batch and order overlapping in a fuzzy environment by employing triangular fuzzy numbers. It is assumed that the imperfect items identified by…
We consider an M/M/1 feedback queue in which service attempts may fail, requiring the customer to rejoin the queue. Arriving customers act strategically, deciding whether to join the queue based on a threshold strategy that depends on the…