Zobrazeno 1 - 10
of 318
pro vyhledávání: '"Larson, Richard C."'
This paper derives recursive algorithms for efficiently computing event probabilities related to order statistics and applies the results in a queue inferencing setting. Consider a set of N i.i.d. random variables in [0, 1]. When the experimental val
Externí odkaz:
http://hdl.handle.net/1721.1/5131
Autor:
Berman, Oded, Larson, Richard C., 1943
We define a service factory to be a network of service-related-workstations, at which assigned workers process work-in-progress that flows through the workstations. Examples of service factory work include mail processing and sorting, check processin
Externí odkaz:
http://hdl.handle.net/1721.1/5341
Discretionary service facilities are providers of products and/or services that are purchased by customers who are traveling on otherwise pre-planned trips such as the daily commute. Optimum location of such facilities requires them to be at or near
Externí odkaz:
http://hdl.handle.net/1721.1/5374
The Queue Inference Engine (QIE) uses queue departure time data over a single congestion period to infer queue statistics. With partial queue-length information, the queue statistics become more accurate and the computational burden is reduced. We fi
Externí odkaz:
http://hdl.handle.net/1721.1/5222
Consider a set of N i.i.d. random variables in [0, 1]. When the experimental values of the random variables are arranged in ascending order from smallest to largest, one has the order statistics of the set of random variables. In this note an O(N3) a
Externí odkaz:
http://hdl.handle.net/1721.1/5159
Automatic teller machines and gasoline service stations are two examples of a growing number of "discretionary service facilities." In consuming service from these facilities, a significant fraction of customers do so on an otherwise preplanned trip
Externí odkaz:
http://hdl.handle.net/1721.1/5206
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
BioScience, 2018 Oct 01. 68(10), 744-745.
Externí odkaz:
https://www.jstor.org/stable/90025668
Consider a multi-priority, nonpreemptive, N-server Poisson arrival queueing system. Service times are negative exponential. In order to save available servers for higher priority customers, arriving customers of each lower priority are deliberately q
Externí odkaz:
http://hdl.handle.net/1721.1/5381
Consider a multi-priority, nonpreemptive, N-server Poisson arrival queueing system. The number of servers requested by an arrival has a known probability distribution. Service times are negative exponential. In order to save available servers for hig
Externí odkaz:
http://hdl.handle.net/1721.1/5320