Related papers: Waves in a Spatial Queue: Stop-and-Go at Airport S…
Giving customers queue length information about a service system has the potential to influence the decision of a customer to join a queue. Thus, it is imperative for managers of queueing systems to understand how the information that they…
We study a single-server priority queue with a finite number of classes, in which the arrivals follow a fractional Poisson process of index $\alpha \in (0,1]$ and the service completions are triggered by an independent fractional Poisson…
Two networks of queues models, presented initially by Jackson, in the open case, and Gordon and Newell, in the closed case, stochastic processes are presented and studied in some of their details and problems. The service times are…
We consider a strategic M/M/1 queueing model under a first-come-first-served regime, where customers are split into two classes and class $A$ has priority over class $B$. Customers can decide whether to join the queue or balk, and, in case…
In discrete time, customers arrive at random. Each waits until one of three servers is available; each thereafter departs at random. We seek the distribution of maximum line length of idle customers. Algebraic expressions obtained for the…
In this paper, we analyze a polling system on a circle. Random batches of customers arrive at a circle, where each customer, independently, obtains a uniform location. A single server cyclically travels over the circle to serve all…
This paper examines a continuous-time routing system with general interarrival and service time distributions, operating under the join-the-shortest-queue and power-of-two-choices policies. Under a weaker set of assumptions than those…
In this paper we study the properties of the Barab\'asi model of queueing under the hypothesis that the number of tasks is steadily growing in time. We map this model exactly onto an Invasion Percolation dynamics on a Cayley tree. This…
The waiting time distribution $w(\tau)$, i.e. the probability for a delay $\tau$ between two subsequent transition (`jumps') of particles, is a statistical tool in (quantum) transport. Using generalized Master equations for systems coupled…
Traffic waves, the spatiotemporal propagation of congestion, are a key feature of traffic flow. As Adaptive Cruise Control (ACC) systems gain widespread adoption and show promise for improving both efficiency and safety, understanding how…
The model is a "generalized switch", serving multiple traffic flows in discrete time. The switch uses MaxWeight algorithm to make a service decision (scheduling choice) at each time step, which determines the probability distribution of the…
This article deals with asynchronous server vacation and customer retrial facility in a multi-server queueing-inventory system. The Poisson process governs the arrival of a customer. The system is comprised of c identical servers, a…
This paper studies an infinite buffer single server queueing model with exponentially distributed service times and negative arrivals. The ordinary (positive) customers arrive in batches of random size according to renewal arrival process,…
The interaction of all mobile species with their environment hinges on their movement patterns: the places they visit and how frequently they go there. In human society, where the prevalent form of cohabitation is in cities, the highly…
We introduce an extension of the M/M/1 queueing process with a spatial structure and excluded- volume effect. The rule of particle hopping is the same as for the totally asymmetric simple exclusion process (TASEP). A stationary-state…
Recently, Atar and Miyazawa [2] introduced a multi-level GI/G/1 queue with a finite number of levels, where both the arrival and service rates depend on the level corresponding to the current queue length. For this model, they proved that…
We introduce a novel single-server queue with general retrial times and event-dependent arrivals. This is a versatile model for the study of service systems, in which the server needs a non-negligible time to retrieve waiting customers upon…
We consider active Brownian particles that intermittently switch between active and inactive states. Such behavior is ubiquitous at all scales, from bacteria to animals and in artificial active systems. We derive exact expressions for key…
Two models of a queue are proposed: a human queue and two lines of vehicles before a narrowing. In both models, a queuer tries to evaluate his waiting time, taking into account the delay caused by intruders who jump to the queue front. As…
Motivated by the increasing use of online appointment booking platforms, we study how to offer appointment slots to customers in order to maximize the total number of slots booked. We develop two models, non-sequential offering and…