R
Ronald W. Wolff
Researcher at University of California, Berkeley
Publications - 39
Citations - 1878
Ronald W. Wolff is an academic researcher from University of California, Berkeley. The author has contributed to research in topics: Queue & G/G/1 queue. The author has an hindex of 16, co-authored 39 publications receiving 1799 citations. Previous affiliations of Ronald W. Wolff include Tokyo Metropolitan University.
Papers
More filters
Journal ArticleDOI
Poisson Arrivals See Time Averages
TL;DR: This paper presents a proof of this result under one basic assumption: the process being observed cannot anticipate the future jumps of the Poisson process.
Journal ArticleDOI
The Optimal Order of Service in Tandem Queues
TL;DR: This paper considers tandem queues for which the order of performing service tasks can be changed, the service times being independent of this order, and determines the optimal order of service when either theservice times of different tasks are nonoverlapping or the service time of one task is constant.
Journal ArticleDOI
Aggregation and Proration in Forecasting
E. Shlifer,Ronald W. Wolff +1 more
TL;DR: In this paper, conditions under which a the sum of forecasts of sales in market segments is preferred to a forecast of the whole market and b the forecast of an individual market segment is preferable to the forecast obtained through proration of a forecast for the entire market were determined.
Journal ArticleDOI
Problems of Statistical Inference for Birth and Death Queuing Models
TL;DR: In this article, a large sample theory for birth and death queuing processes which are ergodic and metrically transitive is applied to make inferences about arrival and service rates.
Journal ArticleDOI
A Comparison Between Tandem Queues with Dependent and Independent Service Times
Michael Pinedo,Ronald W. Wolff +1 more
TL;DR: Tandem queues in which a given customer has equal service times at each station are considered and the waiting time and system capacity in the case where any givenCustomer has independent service times are compared with the waiting Time and System Capacity in the Case M/M/1 → M/1.