相关论文: The analysis of batch sojourn-times in polling sys…
The paper analyzes the performance of tandem network of polling queue with setups. For a system with two-products and two-stations, we propose a new approach based on a partially-collapsible state-space characterization to reduce…
A state-dependent 1-limited polling model with N queues is analyzed. The routing strategy generalizes the classical Markovian polling model, in the sense that two routing matrices are involved, the choice being made according to the state…
The career of an employee can be described (under certain circumstances) by a random walk, where the states of the random walk are determined by the level and position of an employee. At each decision moment the state of the employee is…
Ride sharing services combine trips of multiple users in the same vehicle and may provide more sustainable transport than private cars. As mobility demand varies during the day, the travel times experienced by passengers may substantially…
This paper considers a parallel system of queues fed by independent arrival streams, where the service rate of each queue depends on the number of customers in all of the queues. Necessary and sufficient conditions for the stability of the…
Given a sequence $(\mathfrak{X}_i, \mathscr{K}_i)_{i=1}^\infty$ of Markov chains, the cut-off phenomenon describes a period of transition to stationarity which is asymptotically lower order than the mixing time. We study mixing times and…
Understanding fluctuations of observables across stochastic trajectories is essential for various fields of research, from quantum thermal machines to biological motors. We introduce a framework to analyze the statistics of counting…
Bicycle-sharing systems, which can provide shared bike usage services for the public, have been launched in many big cities. In bicycle-sharing systems, people can borrow and return bikes at any stations in the service region very…
Approximations for the mean performance indices for the M/G/c queue rely on the approximate computation of the probability that an arriving request has to wait for service and of the minimum of residual service times if all servers are…
This paper addresses the analysis of the queue-length process of single-server queues under overdispersion, i.e., queues fed by an arrival process for which the variance of the number of arrivals in a given time window exceeds the…
We consider the problem of bounding mean first passage times for a class of continuous-time Markov chains that captures stochastic interactions between groups of identical agents. The quantitative analysis of such probabilistic population…
A discrete-time batch service queue with batch renewal input and random serving capacity rule under the late arrival delayed access system (LAS-DA), has recently appeared in the literature [2]. In this paper, we consider the same model…
Vacation queueing systems are widely used as an extension of the classical queueing theory. We consider both working vacations and regular vacations in this paper, and compare systems with vacations to the regular $M/M/1$ system via mean…
Iterative voting is a natural model of repeated strategic decision-making in social choice theory when agents have the opportunity to update their votes prior to finalizing the group decision. Prior work has analyzed the efficacy of…
We consider the $M/M/1$ queue with processor sharing. We study the conditional sojourn time distribution, conditioned on the customer's service requirement, in various asymptotic limits. These include large time and/or large service…
In this paper we study a two-queue polling model with zero switch-over times and $k$-limited service (serve at most $k_i$ customers during one visit period to queue $i$, $i=1,2$) in each queue. The arrival processes at the two queues are…
We consider polling models in the sense of Takagi (MIT Press, 1986). In our case, the feature of the server is that it may be forced to wait idly for new messages at an empty queue instead of switching to the next station. We propose four…
We investigate the sojourn time above a high threshold of a continuous stochastic process Y on [0,1]. It turns out that the limit, as the threshold increases, of the expected sojourn time given that it is positive, exists if the copula…
Our study focuses on designing reliable service time windows for customers in a last-mile delivery system to boost dependability and enhance customer satisfaction. To construct time windows for a pre-determined route (e.g., provided by…
Stochastic clearing theory has wide spread applications in the context of supply chain and service operations management. Historical application domains include bulk service queues, inventory control, and transportation planning (e.g.,…