Related papers: Overlapping time of a virtual customer in time-var…
Given a pair of multivariate time-series data of the same length and dimensions, an approach is proposed to select variables and time intervals where the two series are significantly different. In applications where one time series is an…
We introduce and study a queue with the Erlang service system and whose arrivals are governed by a counting process in which there is a possibility of finitely many arrivals in an infinitesimal time interval. We call it the Erlang queue…
To draw real-world evidence about the comparative effectiveness of multiple time-varying treatments on patient survival, we develop a joint marginal structural survival model and a novel weighting strategy to account for time-varying…
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 establish heavy-traffic stochastic-process limits for waiting times in many-server queues with customer abandonment. If the system is asymptotically critically loaded, as in the quality-and-efficiency-driven (QED) regime, then a bounding…
The blocking problem naturally arises in transportation systems as multiple vehicles with different itineraries share available resources. In this paper, we investigate the impact of the blocking problem to the waiting time at the…
The identification of similar patient pathways is a crucial task in healthcare analytics. A flexible tool to address this issue are parametric competing risks models, where transition intensities may be specified by a variety of parametric…
Consider the problem of a multi-user multiple access channel. While several multi-user coding techniques exist, in practical scenarios, not all users can be scheduled simultaneously. Thus, a key problem is which users to schedule in a given…
We study a queueing network with a single shared server, that serves the queues in a cyclic order according to the gated service discipline. External customers arrive at the queues according to independent Poisson processes. After…
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…
The paper studies a multiserver retrial queueing system with $m$ servers. Arrival process is a point process with strictly stationary and ergodic increments. A customer arriving to the system occupies one of the free servers. If upon…
We analyze a tandem network of polling queues with two product types and two stations. We assume that external arrivals to the network follow a Poisson process, and service times at each station are exponentially distributed. For this…
In this paper we consider a single-server, cyclic polling system with switch-over times and Poisson arrivals. The service disciplines that are discussed, are exhaustive and gated service. The novel contribution of the present paper is that…
We consider the processor sharing $M/M/1$-PS queue which also models balking. A customer that arrives and sees $n$ others in the system "balks" (i.e., decides not to enter) with probability $1-b_n$. If $b_n$ is inversely proportional to…
The culture of sharing instead of ownership is sharply increasing in individuals behaviors. Particularly in transportation, concepts of sharing a ride in either carpooling or ridesharing have been recently adopted. An efficient optimization…
We study a queueing network with a single shared server that serves the queues in a cyclic order. External customers arrive at the queues according to independent Poisson processes. After completing service, a customer either leaves the…
This paper considers competitive mobility-on-demand systems where a group of vehicle sharing companies, on one hand, want to collectively regulate the traffic of the user queueing network, and on the other hand, maximize their own profits…
Large content providers and content distribution network operators usually connect with large Internet service providers (eyeball networks) through dedicated private peering. The capacity of these private network interconnects is…
Delay or queue length information has the potential to influence the decision of a customer to use a service system. Thus, it is imperative for service system managers to understand how the information that they provide will affect the…
Queues that feature multiple entities arriving simultaneously are among the oldest models in queueing theory, and are often referred to as "batch" (or, in some cases, "bulk") arrival queueing systems. In this work we study the affect of…