University of Southern California

Amy Ward
Associate Professor of Data Sciences and Operations

USC Marshall School of Business
Los Angeles, CA 90089-0808

Phone: 
213-821-2616
Education: 
PhD, MA, Stanford University; BA, Claremont McKenna College

Overview

Amy Ward's research focuses on the approximation and control of stochastic systems, with applications to manufacturing and service systems. Much of her work has focused on the impact of customer impatience and abandonments on service system performance. Her research has been published in Mathematics of Operations Research, Journal of Applied Probability, and Queueing Systems. Prior to joining USC, she was an assistant professor in the Department of Industrial and Systems Engineering at Georgia Tech.

Research

On the Dynamic Control of Matching Queues 2013
Dynamic Scheduling of an N System with Reneging 2012
Blind Fair Routing in Large-Scale Service Systems 2012
Routing to Minimize Waiting and Callbacks in Large Call Centers 2012
Dynamic Scheduling of a GI/GI/1+GI Queue with Multiple Customer Classes 2012
On the Generalized Skorokhod Problem 2012
The \Delta_(i)/GI/1 Queue 2012
Asymptotic Analysis of Queueing Systems with Reneging: A Survey of Results for FIFO, Single Class Models 2011
Asymptotic Analysis of Queueing Systems with Reneging: A Survey of Results for FIFO, Single Class Models 2010
Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems 2010
Managing Service Systems with an Offline Waiting Option and Customer Abandonment 2009
Optimal Control of a High Volume Assemble-to-Order System with Leadtime Quotations and Expediting 2008
Approximating the GI/GI/1+GI Queue with a Nonlinear Drift Diffusion: Hazard Rate Scaling in Heavy Traffic 2008
Asymptotically Optimal Admision Control of a Queue with Impatient Customers 2008
Optimal Control of a High Volume Assemble-to-Order System 2006
A diffusion approximatino for a GI/GI/1 queue with balking or reneging 2005
A Diffusion Approximation for a Markovian Queue with Reneging 2003
On stability of queueing networks with job deadlines 2003
Propoerties of the reflected Ornstein-Uhlenbeck process 2003
Critical Thresholds for Dynamic Routing in Queueing Networks 2002
Predicting Response Times in Processor-Sharing Queues 2000
Internet service performance failure detection 1998
Internet service performance failure detection 1998
Managing Service Systems with an Offline Waiting Option and Customer Abandonment
Design of Multistar Many-to-Many Distribution Networks
Note: A Separation Principle for a Class of Assemble-to-Order Systems with Expediting