Related papers: How to Staff When Customers Arrive in Batches
This paper purpose is to investigate exponential behavior conditions for the infinite servers queue with Poisson arrivals busy period length distribution. It is presented a general theoretical result that is the basis of this work. The…
Many stochastic systems have arrival processes that exhibit clustering behavior. In these systems, arriving entities influence additional arrivals to occur through self-excitation of the arrival process. In this paper, we analyze an…
The queue system,with Poisson arrivals,constant service time and infinite servers, busy period distribution is intensively studied because, due to its probability density function quite easy interpretation, it may serve as a clue to…
Motivated by the operational problems in click and collect systems, such as curbside pickup programs, we study a joint admission control and capacity allocation problem. We consider a system where arriving customers have preferred service…
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,…
Stochastic service systems describe situations in which customers compete for service from scarce resources. Think of check-in lines at airports, waiting rooms in hospitals or queues in supermarkets, where the scarce resource is human…
In the context of decision making under explorable uncertainty, scheduling with testing is a powerful technique used in the management of computer systems to improve performance via better job-dispatching decisions. Upon job arrival, a…
Motivated by the ongoing COVID-19 pandemic, this paper investigates customers' infection risk by evaluating the overlapping time of a virtual customer with others in queueing systems. Most of the current methodologies focus on…
We consider a load balancing system consisting of $n$ single-server queues working in parallel, with heterogeneous service rates. Jobs arrive to a central dispatcher, which has to dispatch them to one of the queues immediately upon arrival.…
Performance modeling is a key issue in queuing theory and operation research. It is well-known that the length of a queue that awaits service or the time spent by a job in a queue depends not only on the service rate, but also crucially on…
Crowding in train cars is increasingly a major concern for transit agencies. From the perspective of the passengers and the transit agencies, overcrowding of the train cars has several negative consequences such as: (i) extended duration of…
In this paper, we introduce a model of dynamical queue, in which the service time depends on the server utilization history. The proposed queueing model is motivated by widely accepted empirical laws describing human performance as a…
We study a system, where a random flow of customers is served by servers (called agents) invited on-demand. Each invited agent arrives into the system after a random time; after each service completion, an agent returns to the system or…
A many-server heavy-traffic FCLT is proved for the $G_t/M/s_t+\mathit {GI}$ queueing model, having time-varying arrival rate and staffing, a general arrival process satisfying a FCLT, exponential service times and customer abandonment…
This paper proposes a stochastic framework to evaluate the performance of public transit systems under short random service suspensions. We aim to derive closed-form formulations of the mean and variance of the queue length and waiting…
We consider a generalized processing system having several queues, where the available service rate combinations are fluctuating over time due to reliability and availability variations. The objective is to allocate the available resources,…
This paper introduces a new asymptotic regime for simplifying stochastic models having non-stationary effects, such as those that arise in the presence of time-of-day effects. This regime describes an operating environment within which the…
We consider a stochastic bipartite matching model consisting of multi-class customers and multi-class servers. Compatibility constraints between the customer and server classes are described by a bipartite graph. Each time slot, exactly one…
This paper examines a single-server queueing system that serves both scheduled and strategic walk-in customers. The service discipline follows a first-come, first-served policy, with scheduled customers granted non-preemptive priority. Each…
I develop a continuous-time model in which an incumbent batch-service provider faces stochastic passenger arrivals and must decide when to dispatch under the threat of customer defection to a faster entrant. The incumbent's problem is…