default search action
Avishai Mandelbaum
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j53]Manlu Chen
, Opher Baron
Frontiers in Operations: Waiting Experience in Open-Shop Service Networks: Improvements via Flow Analytics and Automation. Manuf. Serv. Oper. Manag. 26(4): 1211-1228 (2024) - 2023
- [j52]Armann Ingolfsson
Preface to the Special Issue on Behavioral Queueing Science: The Need for a Multidisciplinary Approach. Oper. Res. 71(3): 791-797 (2023) - 2022
- [j51]Junfei Huang
Appointment-driven service systems with many servers. Queueing Syst. Theory Appl. 100(3-4): 529-531 (2022) - 2020
- [j50]Avishai Mandelbaum, Petar Momcilovic, Nikolaos Trichakis
Data-Driven Appointment-Scheduling Under Uncertainty: The Case of an Infusion Unit in a Cancer Center. Manag. Sci. 66(1): 243-270 (2020) - [j49]Noa Zychlinski
Bed Blocking in Hospitals Due to Scarce Capacity in Geriatric Institutions - Cost Minimization via Fluid Models. Manuf. Serv. Oper. Manag. 22(2): 396-411 (2020)
2010 – 2019
- 2019
- [j48]David Azriel
Erlang-S: A Data-Based Model of Servers in Queueing Networks. Manag. Sci. 65(10): 4607-4635 (2019) - 2018
- [j47]Arik Senderovich, Alexander Shleyfman, Matthias Weidlich
To aggregate or to eliminate? Optimal model simplification for improved process performance prediction. Inf. Syst. 78: 96-111 (2018) - [j46]Noa Zychlinski
Time-varying many-server finite-queues in tandem: Comparing blocking mechanisms via fluid models. Oper. Res. Lett. 46(5): 492-499 (2018) - [j45]Noa Zychlinski
Time-varying tandem queues with blocking: modeling, analysis, and operational insights via fluid models with reflection. Queueing Syst. Theory Appl. 89(1-2): 15-47 (2018) - 2017
- [j44]Junfei Huang
Refined Models for Efficiency-Driven Queues with Applications to Delay Announcements and Staffing. Oper. Res. 65(5): 1380-1397 (2017) - [j43]Avigdor Gal, Avishai Mandelbaum, François Schnitzler
Traveling time prediction in scheduled transportation with journey segments. Inf. Syst. 64: 266-280 (2017) - [j42]Avishai Mandelbaum, Petar Momcilovic:
Personalized queues: the customer view, via a fluid model of serving least-patient first. Queueing Syst. Theory Appl. 87(1-2): 23-53 (2017) - 2016
- [j41]Arik Senderovich, Matthias Weidlich, Liron Yedidsion, Avigdor Gal, Avishai Mandelbaum, Sarah Kadish, Craig A. Bunnell:
Conformance Checking and Performance Improvement in Scheduled Processes: A Queueing-Network Perspective. EMISA Forum 36(2): 57-59 (2016) - [j40]Arik Senderovich, Matthias Weidlich
Conformance checking and performance improvement in scheduled processes: A queueing-network perspective. Inf. Syst. 62: 185-206 (2016) - [c13]Arik Senderovich, Alexander Shleyfman, Matthias Weidlich
P ^3 -Folder: Optimal Model Simplification for Improving Accuracy in Process Performance Prediction. BPM 2016: 418-436 - [c12]Arik Senderovich, Andreas Rogge-Solti
The ROAD from Sensor Data to Process Instances via Interaction Mining. CAiSE 2016: 257-273 - [c11]Arik Senderovich, Matthias Weidlich, Liron Yedidsion, Avigdor Gal, Avishai Mandelbaum, Sarah Kadish, Craig A. Bunnell:
Conformance Checking and Performance Improvement in Scheduled Processes: A Queueing-Network Perspective (Extended Abstract). EMISA 2016: 72-74 - 2015
- [j39]Junfei Huang
Control of Patient Flow in Emergency Departments, or Multiclass Queues with Deadlines and Feedback. Oper. Res. 63(4): 892-908 (2015) - [j38]Arik Senderovich, Matthias Weidlich
Queue mining for delay prediction in multi-class service processes. Inf. Syst. 53: 278-295 (2015) - [c10]Arik Senderovich, Andreas Rogge-Solti
Data-Driven Performance Analysis of Scheduled Processes. BPM 2015: 35-52 - [c9]Arik Senderovich, Sander J. J. Leemans
Discovering Queues from Event Logs with Varying Levels of Information. Business Process Management Workshops 2015: 154-166 - [c8]Arik Senderovich, Matthias Weidlich
Discovery and Validation of Queueing Networks in Scheduled Processes. CAiSE 2015: 417-433 - [c7]Avigdor Gal, Avishai Mandelbaum, François Schnitzler, Arik Senderovich, Matthias Weidlich:
On Predicting Traveling Times in Scheduled Transportation (Extended Abstract). MUD@ICML 2015: 88-89 - 2014
- [j37]Itai Gurvich
Excursion-Based Universal Approximations for the Erlang-A Queue in Steady-State. Math. Oper. Res. 39(2): 325-373 (2014) - [j36]Galit B. Yom-Tov
Erlang-R: A Time-Varying Queue with Reentrant Customers, in Support of Healthcare Staffing. Manuf. Serv. Oper. Manag. 16(2): 283-299 (2014) - [j35]Avishai Mandelbaum, Petar Momcilovic:
Performance-based routing. Oper. Res. Lett. 42(6-7): 418-423 (2014) - [c6]Arik Senderovich, Matthias Weidlich
Mining Resource Scheduling Protocols. BPM 2014: 200-216 - [c5]Arik Senderovich, Matthias Weidlich
Queue Mining - Predicting Delays in Service Processes. CAiSE 2014: 42-57 - 2013
- [j34]Avishai Mandelbaum, Sergey Zeltyn:
Data-stories about (im)patient customers in tele-queues. Queueing Syst. Theory Appl. 75(2-4): 115-146 (2013) - [j33]Avishai Mandelbaum, Sergey Zeltyn:
Erratum to: Data-stories about (im)patient customers in tele-queues. Queueing Syst. Theory Appl. 75(2-4): 147 (2013) - [j32]Ananda P. Weerasinghe, Avishai Mandelbaum:
Abandonment versus blocking in many-server queues: asymptotic optimality in the QED regime. Queueing Syst. Theory Appl. 75(2-4): 279-337 (2013) - 2012
- [j31]Avishai Mandelbaum, Petar Momcilovic, Yulia Tseytlin:
On Fair Routing from Emergency Departments to Hospital Wards: QED Queues with Heterogeneous Servers. Manag. Sci. 58(7): 1273-1291 (2012) - [j30]Avishai Mandelbaum, Petar Momcilovic:
Queues with Many Servers and Impatient Customers. Math. Oper. Res. 37(1): 41-65 (2012) - [c4]Rami Atar, Avishai Mandelbaum, Asaf Zviran:
Control of Fork-Join Networks in heavy traffic. Allerton Conference 2012: 823-830 - 2011
- [j29]Mor Armony, Avishai Mandelbaum:
Routing and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers. Oper. Res. 59(1): 50-65 (2011) - [j28]Sergey Zeltyn, Yariv N. Marmor
Simulation-based models of emergency departments: : Operational, tactical, and strategic staffing. ACM Trans. Model. Comput. Simul. 21(4): 24:1-24:25 (2011) - 2010
- [j27]Avishai Mandelbaum, Sergey Zeltyn:
Service Engineering: Data-Based Course Development and Teaching. INFORMS Trans. Educ. 11(1): 3-19 (2010) - [j26]Avi Mandelbaum, Kavita Ramanan:
Directional Derivatives of Oblique Reflection Maps. Math. Oper. Res. 35(3): 527-558 (2010) - [j25]Polyna Khudyakov, Paul D. Feigin
Designing a call center with an IVR (Interactive Voice Response). Queueing Syst. Theory Appl. 66(3): 215-237 (2010) - [c3]Zohar Feldman, Avishai Mandelbaum:
Using simulation-based Stochastic Approximation to optimize staffing of systems with Skills-Based-Routing. WSC 2010: 3307-3317
2000 – 2009
- 2009
- [j24]Avishai Mandelbaum, Sergey Zeltyn:
Staffing Many-Server Queues with Impatient Customers: Constraint Satisfaction in Call Centers. Oper. Res. 57(5): 1189-1205 (2009) - [j23]Rami Atar, Avi Mandelbaum, Gennady Shaikhet:
Simplified Control Problems for Multiclass Many-Server Queueing Systems. Math. Oper. Res. 34(4): 795-812 (2009) - [c2]Segev Wasserkrug, Ohad Greenshpan, Yariv N. Marmor
InEDvance: Advanced IT in Support of Emergency Department Management. NGITS 2009: 86-95 - [c1]Yariv N. Marmor
Toward Simulation-based Real-time Decision-support Systems for Emergency Departments. WSC 2009: 2042-2053 - 2008
- [j22]Itay Gurvich
Service-Level Differentiation in Call Centers with Fully Flexible Servers. Manag. Sci. 54(2): 279-294 (2008) - [j21]Zohar Feldman, Avishai Mandelbaum, William A. Massey, Ward Whitt:
Staffing of Time-Varying Queues to Achieve Time-Stable Performance. Manag. Sci. 54(2): 324-338 (2008) - [j20]Avishai Mandelbaum, Petar Momcilovic:
Queues with Many Servers: The Virtual Waiting-Time Process in the QED Regime. Math. Oper. Res. 33(3): 561-586 (2008) - 2005
- [j19]Sergey Zeltyn, Avishai Mandelbaum:
Call Centers with Impatient Customers: Many-Server Asymptotics of the M/M/n + G Queue. Queueing Syst. Theory Appl. 51(3-4): 361-402 (2005) - 2004
- [j18]Sem C. Borst, Avishai Mandelbaum, Martin I. Reiman:
Dimensioning Large Call Centers. Oper. Res. 52(1): 17-34 (2004) - [j17]Avishai Mandelbaum, Alexander L. Stolyar:
Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cµ-Rule. Oper. Res. 52(6): 836-855 (2004) - [j16]Avi Mandelbaum, Sergey Zeltyn:
The impact of customers' patience on delay and abandonment: some empirically-driven experiments with the M/M/n + G queue. OR Spectr. 26(3): 377-411 (2004) - [j15]Predrag R. Jelenkovic, Avishai Mandelbaum, Petar Momcilovic:
Heavy Traffic Limits for Queues with Many Deterministic Servers. Queueing Syst. Theory Appl. 47(1-2): 53-69 (2004) - [j14]Nahum Shimkin, Avishai Mandelbaum:
Rational Abandonment from Tele-Queues: Nonlinear Waiting Costs with Heterogeneous Preferences. Queueing Syst. Theory Appl. 47(1-2): 117-146 (2004) - [j13]Rami Atar, Avi Mandelbaum, Martin I. Reiman:
A Brownian control problem for a simple queueing system in the Halfin-Whitt regime. Syst. Control. Lett. 51(3-4): 269-275 (2004) - 2003
- [j12]Noah Gans, Ger Koole
Telephone Call Centers: Tutorial, Review, and Research Prospects. Manuf. Serv. Oper. Manag. 5(2): 79-141 (2003) - 2002
- [j11]Ger Koole
Queueing Models of Call Centers: An Introduction. Ann. Oper. Res. 113(1-4): 41-59 (2002) - [j10]Ety Zohar, Avishai Mandelbaum, Nahum Shimkin:
Adaptive Behavior of Impatient Customers in Tele-Queues: Theory and Empirical Support. Manag. Sci. 48(4): 566-583 (2002) - [j9]O. Garnett, Avishai Mandelbaum, Martin I. Reiman:
Designing a Call Center with Impatient Customers. Manuf. Serv. Oper. Manag. 4(3): 208-227 (2002) - [j8]Avishai Mandelbaum, William A. Massey, Martin I. Reiman, Alexander L. Stolyar, Brian Rider:
Queue Lengths and Waiting Times for Multiserver Queues with Abandonment and Retrials. Telecommun. Syst. 21(2): 149-171 (2002) - 2000
- [j7]Avishai Mandelbaum, Nahum Shimkin:
A model for rational abandonments from invisible queues. Queueing Syst. Theory Appl. 36(1-3): 141-173 (2000)
1990 – 1999
- 1998
- [j6]Avishai Mandelbaum, Sergey Zeltyn:
Estimating characteristics of queueing networks using transactional data. Queueing Syst. Theory Appl. 29(1): 75-127 (1998) - [j5]Avishai Mandelbaum, William A. Massey, Martin I. Reiman:
Strong approximations for Markovian service networks. Queueing Syst. Theory Appl. 30(1-2): 149-201 (1998) - 1995
- [j4]Avi Mandelbaum, William A. Massey:
Strong Approximations for Time-Dependent Queues. Math. Oper. Res. 20(1): 33-64 (1995) - 1994
- [j3]Haya Kaspi, Avi Mandelbaum:
On Harris Recurrence in Continuous Time. Math. Oper. Res. 19(1): 211-222 (1994) - 1991
- [j2]Hong Chen, Avi Mandelbaum:
Discrete Flow Networks: Bottleneck Analysis and Fluid Approximations. Math. Oper. Res. 16(2): 408-446 (1991)
1980 – 1989
- 1988
- [j1]Hong Chen, J. Michael Harrison, Avi Mandelbaum, Ann van Ackere, Lawrence M. Wein:
Empirical Evaluation of a Queueing Network Model for Semiconductor Wafer Fabrication. Oper. Res. 36(2): 202-215 (1988)
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-05 20:58 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: