Operations Research Center Working Papers: Recent submissions
Now showing items 253-255 of 372
-
Deducing Queueing From Transactional Data: The Queue Inference Engine, Revisited
(Massachusetts Institute of Technology, Operations Research Center, 1990-04)Larson [1] proposed a method to statistically infer the expected transient queue length during a busy period in 0(n 5 ) solely from the n starting and stopping times of each customer's service during the busy period and ... -
The Minimum Spanning Tree Constant in Geometrical Probability and Under the Independent Model; A Unified Approach
(Massachusetts Institute of Technology, Operations Research Center, 1990-04)Given n uniformly and independently points in the d dimensional cube of unit volume, it is well established that the length of the minimum spanning tree on these n points is asymptotic to /3MsT(d)n(d-l)/d,where the constant ... -
Networks of Non-homogeneous M/G/oo Systems
(Massachusetts Institute of Technology, Operations Research Center, 1990-01)For a network of G/oo service facilities, the transient joint distribution of the facility populations is found to have a simple Poisson product form with simple explicit formula for the means. In the network it is assumed ...


