Abstract. We present fully polynomial approximation schemes for the problem of minimizing completion time variance of a set of n jobs on a single machine. The fastest of these sche...
Wieslaw Kubiak, Jinliang Cheng, Mikhail Y. Kovalyo...
Continuing research by Jennings, Mandelbaum, Massey and Whitt (1996), we investigate methods to perform time-dependent staffing for many-server queues. Our aim is to achieve time-...
Zohar Feldman, Avishai Mandelbaum, William A. Mass...
We describe Social Net, a novel interest-matching application that uses patterns of collocation, over time, to infer shared interests between users. Social Net demonstrates new po...
Michael A. Terry, Elizabeth D. Mynatt, Kathy Ryall...
This paper proposes a framework for integrating the Real-Time Specification for Java and Java's Remote Method Invocation. The concepts of real-time remote and distributed rea...
Andy J. Wellings, Roy Clark, E. Douglas Jensen, Do...
We derive the waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic (or constant) service times. We show that the procedure for...