Mor Armony, Stern School of Business, NYU

• The Impact of Delay Announcements in Many-Server Queues with Abandonment. working paper, 2005. Submitted to Management Science. (with Mor Armony and Nahum Shimkin). [PDF]
• The Impact of Delay Announcements in Many-Server Queues with Abandonment: Supplementary Material. working paper, 2005. Supporting material for paper with same title. (with Mor Armony and Nahum Shimkin). [PDF]

Andre Bondi, Software Engineering Department, Siemens Corporate Research

• The Influence of Service-Time Variability in a Closed Network of Queues. Performance Evaluation, vol. 6, September 1986, pp. 219-234. [published PDF]

Sid Browne, Graduate School of Business, Columbia University (and Goldman, Sachs Asset Management)

• Piecewise-Linear Diffusion Processes. Advances in Queueing, J. Dshalalow, ed., CRC Press, Boca Raton, FL, 1995, pp. 463-480 (with Sid Browne). [published PDF]
• Portfolio Choice and The Bayesian Kelly Criterion. Advances in Applied Probability, vol. 28, 1996, pp. 1145-1176 (with Sid Browne). [published PDF]

Hong Chen, Faculty of Commerce, University of British Columbia

• Diffusion Approximations for Open Queueing Networks with Service Interruptions. Queueing Systems, vol. 13, No. 4, 1993, pp. 335-359.

Edward G. Coffman, Jr., Department of Electrical Engineering, Columbia University

• Recent Asymptotic Results in the Probabilistic Analysis of Schedule Makespans. Scheduling Theory and its Applications, P. Chrétienne, E. G. Coffman, Jr., J. K. Lenstra and Z. Liu (eds.), Wiley, New York, 1995, pp. 15-31.
• Stochastic Limit Laws for Schedule Makespans. Stochastic Models, vol. 12, No. 2, 1996, pp. 215-243 (with E. G. Coffman, Jr. and Leopold Flatto). [published PDF]

Charles (Chuck) Crow, IV, Columbia University doctoral student

• Two-Moment Approximations for Maxima. working paper, 2005. (with Chuck Crow and David Goldberg). [PDF]
• Two-Moment Approximations for Maxima: supplement. working paper, 2005. Supporting material for paper with same title. (with Chuck Crow and David Goldberg). [PDF]

Jimmie L. Davis

• Sensitivity to the Service-Time Distribution in the Nonstationary Erlang Loss Model. Management Science, vol. 41, No. 6, 1995, pp. 1107-1116 (with Jimmie L. Davis and Bill Massey). [published PDF]

Ralph Disney, Department of Industrial Engineering, Texas A&M University retired

• Queueing Theory. McGraw-Hill Yearbook of Science and Technology, McGraw-Hill, New York, 1991, pp. 377-383 (with R. C. Larson and M. A. Wortman).

Peter Donnelly, Department of Statistics, University of Oxford

• On Reinforcement-Depletion Compartmental Urn Models. Journal of Applied Probability, vol. 26, No. 3, 1989, pp. 477-489.

Stephen G. Eick, Chief Technology Officer, Visual Insights

• The Physics of The M_t/G/infty Queue. Operations Research, vol. 41, No. 4, 1993, pp. 731-742 (with Stephen G. Eick). [published PDF]
• M_t/G/infty Queues with Sinusoidal Arrival Rates. Management Science, vol. 39, No. 2, 1993, pp. 241-252 (with Stephen G. Eick). [published PDF]

Zohar Feldman, MS student, Faculty of Industrial Engineering and Management, The Technion

• Staffing of Time-Varying Queues to Achieve Time-Stable Performance. working paper, 2004. Revised 2005. Submitted to Management Science. (with Zohar Feldman, Avishai Mandelbaum and Bill Massey) [PDF].
• Staffing of Time-Varying Queues to Achieve Time-Stable Performance, Unabridged Version: Internet Supplement. working paper, 2005. (with Zohar Feldman, Avishai Mandelbaum and Bill Massey) [PDF].

Anja Feldmann, Computer Science Department, Technical University of Munich, Germany

• Fitting Mixtures of Exponentials to Long-Tail Distributions to Analyze Network Performance Models. IEEE Infocom `97, 1997, pp. 1098-1106. [published PDF]
• Fitting Mixtures of Exponentials to Long-Tail Distributions to Analyze Network Performance Models. Performance Evaluation, vol. 31, 1998, pp. 245-279 (with Anja Feldmann). [published PDF]

Leo Flatto, Mathematics Sciences Research Center, Bell Labs, retired

• Stochastic Limit Laws for Schedule Makespans. Stochastic Models, vol. 12, No. 2, 1996, pp. 215-243 (with E. G. Coffman, Jr.). [published PDF]

David A. Goldberg, 2006 BS, Computer Science Department, Columbia University

• Two-Moment Approximations for Maxima. working paper, 2005. (with Chuck Crow and David Goldberg). [PDF]
• Two-Moment Approximations for Maxima: supplement. working paper, 2005. Supporting material for paper with same title. (with Chuck Crow and David Goldberg). [PDF]

Daniel Goroff, Vice President, Dean of the Faculty, Harvey Mudd College; formerly Professor, Department of Mathematics at Harvard University.

• Approximating the Admissible Set in Stochastic Dominance. Journal of Economic Theory, vol. 23, No. 2, October 1980, pp. 218-235. [published PDF]

Linda V. Green, Graduate School of Business, Columbia University

• Coping with Time-Varying Demand when Setting Staffing Requirements for a Service System. working paper, 2005. Production and Operations Management (POMS), forthcoming. (with Linda V. Green and Peter J. Kolesar). [PDF]

Nathaniel Grier

• The Time-Dependent Erlang Loss Model with Retrials. Proceedings of INFORMS Telecommunications Conference, Telecommunications Systems, R. B. Cooperand and R. Doverspike (eds.), vol. 7, 1997, pp. 253-265 (with William A. Massey and Tyrone McKoy). [PostScript] [PDF] [published PDF]

Shlomo Halfin, Bellcore retired (sh@research.telcordia.com)

• Heavy-Traffic Limits for Queues with Many Exponential Servers. Operations Research, vol. 29, No. 3, May-June 1981, pp. 567-588 (with Shlomo Halfin). [published PDF]
• An Extremal Property of the FIFO Discipline Via An Ordinal Version of L = W. Stochastic Models, vol. 5, No. 3, 1989, pp. 515-529. [published PDF]

Daniel P. Heyman, AT&T Labs, retired

• The Asymptotic Behavior of Queues with Time-Varying Arrival Rates. Journal of Applied Probability, vol. 21, No. 1, March 1984, pp. 143-156.
• Limits for Queues as the Waiting Room Grows. Queueing Systems, vol. 5, No. 4, 1989, pp. 381-392. [PDF] [published PDF]

Gísli Hjálmtýsson, Computer Science Department, Reykjavik University, Iceland

• Periodic Load Balancing. Queueing Systems, vol. 30, Nos. 1-2, 1998, pp. 203-250. [PostScript] [PDF] [published PDF]
• Approximations for Periodic Load Balancing. 37th IEEE Conference on Decision and Control, Tampa, Florida. [published PDF]

Otis B. Jennings, The Fuqua School of Business, Duke University

• Server Staffing to Meet Time-Varying Demand. Management Science, vol. 42, No. 10, 1996, pp. 1383-1394 (with Otis B. Jennings and Avishai Mandelbaum). [published PDF]

Wanmo Kang, Rutter Associates LLC, New York; 2005 PhD, IEOR Department, Columbia University

• Exploiting Regenerative Structure to Estimate Finite Time Averages via Simulation. ACM Transactions on Modeling and Computer Simulation (TOMACS), forthcoming. (with Wanmo Kang and Perwez Shahabuddin). [PDF]
• Exploiting Regenerative Structure to Estimate Finite Time Averages via Simulation: Supplementary Material. working paper, 2005. Supporting material for paper with same title. (with Wanmo Kang and Perwez Shahabuddin). [PDF]

Masaaki Kijima, Graduate School of Economics, Kyoto University

• Decompositions of the M/M/1 Transition Function. Queueing Systems, vol. 9, No. 3, 1991, pp. 323-336 (with Joseph Abate). [published PDF]

John G. Klincewicz, AT&T Labs, Middletown, NJ

• On Approximations for Queues, II: Shape Constraints, AT&T Bell Laboratories Technical Journal, vol. 63, No. 1, January 1984, pp. 139-161. [published PDF]

Peter J. Kolesar, Graduate School of Business, Columbia University

• Coping with Time-Varying Demand when Setting Staffing Requirements for a Service System. working paper, 2005. Production and Operations Management (POMS), forthcoming. (with Linda V. Green and Peter J. Kolesar). [PDF]

Richard C. Larson, Operations Research Center, MIT

• Queueing Theory. McGraw-Hill Yearbook of Science and Technology, McGraw-Hill, New York, 1991, pp. 377-383 (with M. A. Wortman and R. L. Disney).

Armand Makowski, Department of Electrical Engineering, University of Maryland

• On Averages Seen By Arrivals in Discrete Time. Proceedings of the 28th IEEE Conference on Decision and Control, December 1989, pp. 1084-1086 (with Benjamin Melamed). [published PDF]

Clement McCalla, AT&T, Middletown, NJ (cmccalla@att.com)

• Applications of the Infinite-Server Queue to the Management of Private Line Services. Proceedings of 1997 AT&T Services and Infrastructure Symposium (SIPS-97), Middletown, NJ, November 18-19, 1997, pp. 132-141 (with William A. Massey).
• A Time-Dependent Queueing Network Model to Describe the Life-Cycle Dynamics of a Family of Private-Line Telecommunications Services. Telecommunication Systems, vol. 17, No. 1, 2002, pp. 9-38. [PostScript] [PDF] [published PDF]

Tyrone McKoy, Mathematics Department, The Community College of Baltimore County, CCBC Dundalk (tmckoy@ccbcmd.edu)

• The Time-Dependent Erlang Loss Model with Retrials. Proceedings of INFORMS Telecommunications Conference, Telecommunications Systems, R. B. Cooperand and R. Doverspike (eds.), vol. 7, 1997, pp. 253-265 (with Nathaniel Grier, William A. Massey). [published PDF]

Ardavan Nozari, Salomon Brothers, New York

• Estimating Average Production Intervals Using Inventory Measurements: Little's Law for Partially Observable Processes. Operations Research, vol. 36, No. 2, March-April 1988, pp. 208-223.

Geraldine A. Parker

• Estimating the Parameters of a Nonhomogeneous Poisson Process with Linear Rate. Telecommunication Systems, vol. 5, 1996, pp. 361-388 (with William A. Massey). [PostScript] [PDF] [published PDF]

Martin I. Reiman, Bell Labs, Lucent

• Fluid and Diffusion Limits for Queues in Slowly Changing Random Environments. Stochastic Models, vol. 13, No. 1, 1997, pp. 121-146 (with Gagan Choudhury, Avishai Mandelbaum and Martin I. Reiman). [published PDF]

Otmar Schlunk, Moby Games

• Using Distributed-Event Parallel Simulation to Study Many Queues in Series. Probability in the Engineering and Informational Sciences, vol. 7, No. 2, 1993, pp. 159-186 (with Albert G. Greenberg). [PostScript] [PDF]

Moshe Segal, AT&T

• A Queueing Network Analyzer for Manufacturing. Teletraffic Science for New Cost-Effective Systems, Networks and Services, Proceedings of ITC 12 (ed. M. Bonatti), North-Holland, Amsterdam, 1989, pp. 1146-1152 (with Moshe Segal). [published PDF]

Perwez Shahabuddin, IEOR Department, Columbia University, deceased, November 17, 2005

• Exploiting Regenerative Structure to Estimate Finite Time Averages via Simulation. ACM Transactions on Modeling and Computer Simulation (TOMACS), forthcoming. (with Wanmo Kang and Perwez Shahabuddin). [PDF]
• Exploiting Regenerative Structure to Estimate Finite Time Averages via Simulation: Supplementary Material. working paper, 2005. Supporting material for paper with same title. (with Wanmo Kang and Perwez Shahabuddin). [PDF]

Nahum Shimkin, Electrical Engineering Department, The Technion

• The Impact of Delay Announcements in Many-Server Queues with Abandonment. working paper, 2005. Submitted to Management Science. (with Mor Armony and Nahum Shimkin). [PDF]
• The Impact of Delay Announcements in Many-Server Queues with Abandonment: Supplementary Material. working paper, 2005. Supporting material for paper with same title. (with Mor Armony and Nahum Shimkin). [PDF]

Martin Shubik, Department of Economics, Yale University

• Fiat Money in an Economy with one Nondurable Good and No Credit (A Noncooperative Sequential Game). Topics in Differential Games, A. Blaquiere (Editor), North-Holland Publishing Co., 1973, pp. 401-448. [published PDF].

S. Suresh

• Arranging Queues in Series: A Simulation Experiment. Management Science , vol. 36, No. 2, 1990, pp. 1080-1091. [PostScript] [PDF]
• The Heavy-Traffic Bottleneck Phenomenon in Open Queueing Networks. Operations Research Letters, vol. 9, No. 6, 1990, pp. 355-362 (with S. Suresh). [published PDF]

Rodney B. Wallace, IBM (rodney.wallace@us.ibm.com)

• A Staffing Algorithm for Call Centers with Skill-Based Routing. Manufacturing and Service Operations Management (M&SOM), vol. 7, 2005, pp. 276-294 (with Rodney B. Wallace). [published PDF]
• A Staffing Algorithm for Call Centers with Skill-Based Routing: Supplementary Material. (Extra material related to previous paper), 2004. (with Rodney B. Wallace). [PDF]

Amy R. Ward, ISyE Department, Georgia Institute of Technology

• Predicting Response Times in Processor-Sharing Queues. In Analysis of Communication Networks: Call Centres, Traffic and Performance, Proceedings of the Fields Institute Conference on Communication Networks, D. J. MacDonald and S. J. Turner, (eds.), American Math. Society, Providence, RI, 2000, pp. 1-29. [PostScript] [PDF]

Martin A. Wortman, Department of Industrial Engineering, Texas A&M

• Queueing Theory. McGraw-Hill Yearbook of Science and Technology, McGraw-Hill, New York, 1991, pp. 377-383 (with R. C. Larson and R. L. Disney).