Zobrazeno 1 - 10
of 162
pro vyhledávání: '"Pender, Jamol"'
Autor:
Palomo, Sergio, Pender, Jamol
In this paper, we analyze the steady state maximum overlap time in the M/M/1 queue. We derive the maximum overlap time tail distribution, its moments and the moment generating function. We also analyze the steady state minimum overlap time of the adj
Externí odkaz:
http://arxiv.org/abs/2311.04387
Autor:
Gao, Ruici, Pender, Jamol
In this paper, we investigate overlap times in a two-dimensional infinite server tandem queue. Specifically, we analyze the amount of time that a pair of customers spend overlapping in any station of the two dimensional tandem network. We assume that
Externí odkaz:
http://arxiv.org/abs/2311.01261
In this paper, we investigate the number of customers that overlap or coincide with a virtual customer in an Erlang-A queue. Our study provides a novel approach that exploits fluid and diffusion limits for the queue to approximate the mean and varian
Externí odkaz:
http://arxiv.org/abs/2308.04684
Autor:
Palomo, Sergio D, Pender, Jamol
Overlap times have been studied as a way of understanding the time of interaction between customers in a service facility. Most of the previous analysis relies on the single jump assumption for arrivals, which implies the queue increases by one for e
Externí odkaz:
http://arxiv.org/abs/2302.07410
Autor:
Doldo, Philip, Pender, Jamol
In this paper, we study queueing systems with delayed information that use a generalization of the multinomial logit choice model as its arrival process. Previous literature assumes that the functional form of the multinomial logit model is exponenti
Externí odkaz:
http://arxiv.org/abs/2205.00070
Autor:
Doldo, Philip, Pender, Jamol
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 abandonment. In
Externí odkaz:
http://arxiv.org/abs/2112.05899
Autor:
Doldo, Philip, Pender, Jamol
Distributed delay equations have been used to model situations in which there is some sort of delay whose duration is uncertain. However, the interpretation of a distributed delay equation is actually very different from that of a delay differential
Externí odkaz:
http://arxiv.org/abs/2106.11413
Autor:
Pender, Jamol, Palomo, Sergio
Imagine, you enter a grocery store to buy food. How many peopledo you overlap with in this store? How much time do you overlap witheach person in the store? In this paper, we answer these questions bystudying the overlap times between customers in th
Externí odkaz:
http://arxiv.org/abs/2104.14437
Autor:
Doldo, Philip, Pender, Jamol
Many service systems provide customers with information about the system so that customers can make an informed decision about whether to join or not. Many of these systems provide information in the form of an update. Thus, the information about the
Externí odkaz:
http://arxiv.org/abs/2104.13350
Autor:
Doldo, Philip, Pender, Jamol
It is already well-understood that many delay differential equations with only a single constant delay exhibit a change in stability according to the value of the delay in relation to a critical delay value. Finding a formula for the critical delay i
Externí odkaz:
http://arxiv.org/abs/2012.05005