J
J. Michael Harrison
Researcher at Stanford University
Publications - 87
Citations - 16248
J. Michael Harrison is an academic researcher from Stanford University. The author has contributed to research in topics: Queueing theory & Heavy traffic approximation. The author has an hindex of 45, co-authored 86 publications receiving 15644 citations. Previous affiliations of J. Michael Harrison include University of Florida & University of Bristol.
Papers
More filters
Stochastic Networks and Activity Analysis
TL;DR: Given the broad spectrum of potential applications to be addressed in the theory, what is its proper mathematical setting and what is the general notion of a stochastic processing network?
Journal ArticleDOI
Limit Theorems for Periodic Queues
TL;DR: In this paper, a single-server queue with service times distributed as a general random variable S and with non-stationary Poisson input is considered and the asymptotic distributions associated with Z and W are related in various ways.
Journal ArticleDOI
A note on networks of infinite-server queues
TL;DR: In this article, it was shown that independent motions of customers in the system, which are characteristic of infinite-server networks, lead in a simple way to time-dependent distributions of state, and thence to steady state distributions; moreover, these steady-state distributions often exhibit an invariance with regard to distributions of service in the network.
Journal ArticleDOI
A Priority Queue with Discounted Linear Costs
TL;DR: A nonpreemptive priority queue with a finite number of priority classes, Poisson arrival processes, and general service time distributions is considered, and an expression for the expected present value of rewards received minus costs incurred over an infinite horizon is developed.
Journal ArticleDOI
Reflected Brownian motion in the quadrant: tail behavior of the stationary distribution
TL;DR: The Avram, Dai and Hasenbein solution for the large deviations rate function I(⋅) is re-expressed in a simplified form, showing along the way that the computation of the function reduces to a relatively simple problem of least-cost travel between a point and a line.