default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmy R. Ward
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j34]Angelos Aveklouris, Amber L. Puha, Amy R. Ward
:
A fluid approximation for a matching model with general reneging distributions. Queueing Syst. Theory Appl. 106(3-4): 199-238 (2024)- [c7]Bingxuan Li, Antonio Castellanos, Pengyi Shi, Amy R. Ward:
Combining Machine Learning and Queueing Theory for Data-Driven Incarceration-Diversion Program Management. AAAI 2024: 22920-22926 - [i6]Bingxuan Li, Pengyi Shi, Amy R. Ward:
Latent Feature Mining for Predictive Model Enhancement with Large Language Models. CoRR abs/2410.04347 (2024) - 2022
- [j33]Amber L. Puha, Amy R. Ward:
Fluid Limits for Multiclass Many-Server Queues with General Reneging Distributions and Head-of-the-Line Scheduling. Math. Oper. Res. 47(2): 1192-1228 (2022) - [j32]Yueyang Zhong, Amy R. Ward, Amber L. Puha:
Asymptotically optimal idling in the GI/GI/N+GI queue. Oper. Res. Lett. 50(3): 362-369 (2022) - [c6]Zhiqiang Zhang, Pengyi Shi, Amy R. Ward:
Routing for Fairness and Efficiency in a Queueing Model with Reentry and Continuous Customer Classes. ACC 2022: 4882-4887 - 2021
- [j31]Hailong Cui, Sampath Rajagopalan, Amy R. Ward:
Impact of Task-Level Worker Specialization, Workload, and Product Personalization on Consumer Returns. Manuf. Serv. Oper. Manag. 23(2): 346-366 (2021) - [j30]Amy R. Ward:
Editorial. Oper. Res. Lett. 49(3): 1 (2021) - [j29]Chihoon Lee, Amy R. Ward, Heng-Qing Ye:
Stationary distribution convergence of the offered waiting processes in heavy traffic under general patience time scaling. Queueing Syst. Theory Appl. 99(3-4): 283-303 (2021) - [i5]Angelos Aveklouris, Levi DeValve, Amy R. Ward, Xiaofan Wu:
Matching Impatient and Heterogeneous Demand and Supply. CoRR abs/2102.02710 (2021) - 2020
- [j28]Hailong Cui, Sampath Rajagopalan, Amy R. Ward:
Predicting product return volume using machine learning methods. Eur. J. Oper. Res. 281(3): 612-627 (2020) - [j27]Chihoon Lee, Amy R. Ward, Heng-Qing Ye:
Stationary distribution convergence of the offered waiting processes for GI/GI/1+GI queues in heavy traffic. Queueing Syst. Theory Appl. 94(1-2): 147-173 (2020) - [c5]Yueyang Zhong, YeeMan Bergstrom, Amy R. Ward:
Data-Driven Market-Making via Model-Free Learning. IJCAI 2020: 4461-4468
2010 – 2019
- 2019
- [j26]Dongyuan Zhan, Amy R. Ward:
Staffing, Routing, and Payment to Trade off Speed and Quality in Large Service Systems. Oper. Res. 67(6): 1738-1751 (2019) - [j25]Erhun Özkan, Amy R. Ward:
On the Control of Fork-Join Networks. Math. Oper. Res. 44(2): 532-564 (2019) - 2018
- [j24]Jeunghyun Kim, Ramandeep S. Randhawa, Amy R. Ward:
Dynamic Scheduling in a Many-Server, Multiclass System: The Role of Customer Impatience in Large Systems. Manuf. Serv. Oper. Manag. 20(2): 285-301 (2018) - [j23]Dongyuan Zhan, Amy R. Ward:
The M/M/1+M queue with a utility-maximizing server. Oper. Res. Lett. 46(5): 518-522 (2018) - [j22]Amy R. Ward, Guodong Pang:
Special issue: In honour of Ward Whitt reaching 75. Queueing Syst. Theory Appl. 89(1-2): 1-2 (2018) - 2016
- [j21]Ragavendran Gopalakrishnan, Sherwin Doroudi, Amy R. Ward, Adam Wierman:
Routing and Staffing When Servers Are Strategic. Oper. Res. 64(4): 1033-1050 (2016) - 2015
- [j20]Harsha Honnappa, Rahul Jain, Amy R. Ward:
A queueing model with independent arrivals, and its fluid and diffusion limits. Queueing Syst. Theory Appl. 80(1-2): 71-103 (2015) - 2014
- [j19]Dongyuan Zhan, Amy R. Ward:
Threshold Routing to Trade Off Waiting and Call Resolution in Call Centers. Manuf. Serv. Oper. Manag. 16(2): 220-237 (2014) - [j18]Chihoon Lee, Amy R. Ward:
Optimal pricing and capacity sizing for the GI/GI/1 queue. Oper. Res. Lett. 42(8): 527-531 (2014) - [c4]Harsha Honnappa, Rahul Jain, Amy R. Ward:
Mean field limits by population acceleration. CDC 2014: 3414-3419 - [c3]Ragavendran Gopalakrishnan, Sherwin Doroudi, Amy R. Ward, Adam Wierman:
Routing and staffing when servers are strategic. EC 2014: 713-714 - [i4]Ragavendran Gopalakrishnan, Sherwin Doroudi, Amy R. Ward, Adam Wierman:
Routing and Staffing when Servers are Strategic. CoRR abs/1402.3606 (2014) - [i3]Harsha Honnappa, Rahul Jain, Amy R. Ward:
On Transitory Queueing. CoRR abs/1412.2321 (2014) - 2013
- [j17]Amy R. Ward, Mor Armony:
Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers. Oper. Res. 61(1): 228-243 (2013) - [j16]Josh Reed, Amy R. Ward, Dongyuan Zhan:
On the Generalized Drift Skorokhod Problem in One Dimension. J. Appl. Probab. 50(1): 16-28 (2013) - [j15]Samim Ghamami, Amy R. Ward:
Dynamic Scheduling of a Two-Server Parallel Server System with Complete Resource Pooling and Reneging in Heavy Traffic: Asymptotic Optimality of a Two-Threshold Policy. Math. Oper. Res. 38(4): 761-824 (2013) - [j14]Jeunghyun Kim, Amy R. Ward:
Dynamic scheduling of a GI/GI/1+GI queue with multiple customer classes. Queueing Syst. Theory Appl. 75(2-4): 339-384 (2013) - 2012
- [c2]Harsha Honnappa, Rahul Jain, Amy R. Ward:
The A(i)/GI/l Queue: A new model of transitory queueing. Allerton Conference 2012: 738-745 - [c1]Harsha Honnappa, Rahul Jain, Amy R. Ward:
A new transitory queueing model and its process limits. VALUETOOLS 2012: 11-20 - [i2]Harsha Honnappa, Rahul Jain, Amy R. Ward:
Δ(i)/GI/1: A New Queueing Model For Transitory Queueing Systems. CoRR abs/1206.0720 (2012) - 2010
- [j13]Mor Armony, Amy R. Ward:
Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems. Oper. Res. 58(3): 624-637 (2010) - [j12]Yasar Levent Koçaga, Amy R. Ward:
Admission control for a multi-server queue with abandonment. Queueing Syst. Theory Appl. 65(3): 275-323 (2010)
2000 – 2009
- 2009
- [j11]Vasiliki Kostami, Amy R. Ward:
Managing Service Systems with an Offline Waiting Option and Customer Abandonment. Manuf. Serv. Oper. Manag. 11(4): 644-656 (2009) - [i1]Anton J. Kleywegt, Jinpyo Lee, Amy R. Ward:
A Network Design Problem. Models and Algorithms for Optimization in Logistics 2009 - 2008
- [j10]Amy R. Ward, Sunil Kumar:
Asymptotically Optimal Admission Control of a Queue with Impatient Customers. Math. Oper. Res. 33(1): 167-202 (2008) - [j9]Josh E. Reed, Amy R. Ward:
Approximating the GI/GI/1+GI Queue with a Nonlinear Drift Diffusion: Hazard Rate Scaling in Heavy Traffic. Math. Oper. Res. 33(3): 606-644 (2008) - [j8]Erica L. Plambeck, Amy R. Ward:
Optimal control of a high-volume assemble-to-order system with maximum leadtime quotation and expediting. Queueing Syst. Theory Appl. 60(1-2): 1-69 (2008) - 2007
- [j7]Erica L. Plambeck, Amy R. Ward:
Note: A Separation Principle for a Class of Assemble-to-Order Systems with Expediting. Oper. Res. 55(3): 603-609 (2007) - 2006
- [j6]Erica L. Plambeck, Amy R. Ward:
Optimal Control of a High-Volume Assemble-to-Order System. Math. Oper. Res. 31(3): 453-477 (2006) - 2005
- [j5]Amy R. Ward, Peter W. Glynn:
A Diffusion Approximation for a GI/GI/1 Queue with Balking or Reneging. Queueing Syst. Theory Appl. 50(4): 371-400 (2005) - 2003
- [j4]Amy R. Ward, Peter W. Glynn:
A Diffusion Approximation for a Markovian Queue with Reneging. Queueing Syst. Theory Appl. 43(1-2): 103-128 (2003) - [j3]Amy R. Ward, Peter W. Glynn:
Properties of the Reflected Ornstein-Uhlenbeck Process. Queueing Syst. Theory Appl. 44(2): 109-123 (2003) - 2002
- [j2]Yih-Choung Teh, Amy R. Ward:
Critical Thresholds for Dynamic Routing in Queueing Networks. Queueing Syst. Theory Appl. 42(3): 297-316 (2002)
1990 – 1999
- 1998
- [j1]Amy R. Ward, Peter W. Glynn, Kathy J. Richardson:
Internet service performance failure detection. SIGMETRICS Perform. Evaluation Rev. 26(3): 38-43 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-13 23:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
