Aliza Heching
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Aliza Heching has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- A. Abdulwahab1 shared publication
- Aditya Vempaty
IBM Research—Thomas J. Watson Research
1 shared publication Alan King
1 shared publication- Alan King
Ars Probabilitas and IBM Research (retired), Yorktown Heights, Canada
1 shared publication - Alan Scheller-Wolf
Tepper School of Business, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213
1 shared publication - Alejandro Toriello
H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
1 shared publication
Latest Publications
- 12 March 2026
- Published by Springer Nature in Annals of Operations Research
- p. 1-10
Efficient evaluation of cyclic arbitrage in constant product market makers
- 12 March 2026
- Published by Springer Nature in Annals of Operations Research
- p. 1-10
Efficient evaluation of cyclic arbitrage in constant product market makers
- 27 January 2024
- Published by Springer Nature in Journal of Scheduling
- Vol. 27 (4) , 375-392
Continuity of care in home health care scheduling: a rolling horizon approach
- 27 January 2024
- Published by Springer Nature in Journal of Scheduling
- Vol. 27 (4) , 375-392
Continuity of care in home health care scheduling: a rolling horizon approach
- 22 September 2018
- Published by SAGE Publications in Production and Operations Management
- Vol. 28 (4) , 788-809
Service Center Staffing with Cross‐Trained Agents and Heterogeneous Customers
We model a real‐world service center with cross‐trained agents serving customer requests that are heterogeneous with respect to complexity and priority levels: High priority requests preempt low priority requests and low‐skilled agents can only serve less complex requests, while high skilled agents can serve all requests. Our main aim is to dynamically assign requests to agents considering the priority and complexity levels of requests. We model this system as a Markov chain that is infinite in multiple dimensions and thus is not amenable to exact analysis. We therefore apply approximation and bounding techniques to develop a tractable, novel algorithm using the Matrix Analytic Method. Our algorithm closely approximates the operations of the real‐world service system under a simple but effective threshold‐based request‐assignment policy. Extensive computational results demonstrate the usefulness of our algorithm to minimize costs given an existing staffing configuration, as well as in helping to make long‐term staffing decisions. In addition, our algorithm also has at least two orders of magnitude shorter computation times than each replication of simulation. Hence, it is both fast and accurate.
- 22 September 2018
- Published by SAGE Publications in Production and Operations Management
- Vol. 28 (4) , 788-809
Service Center Staffing with Cross‐Trained Agents and Heterogeneous Customers
We model a real‐world service center with cross‐trained agents serving customer requests that are heterogeneous with respect to complexity and priority levels: High priority requests preempt low priority requests and low‐skilled agents can only serve less complex requests, while high skilled agents can serve all requests. Our main aim is to dynamically assign requests to agents considering the priority and complexity levels of requests. We model this system as a Markov chain that is infinite in multiple dimensions and thus is not amenable to exact analysis. We therefore apply approximation and bounding techniques to develop a tractable, novel algorithm using the Matrix Analytic Method. Our algorithm closely approximates the operations of the real‐world service system under a simple but effective threshold‐based request‐assignment policy. Extensive computational results demonstrate the usefulness of our algorithm to minimize costs given an existing staffing configuration, as well as in helping to make long‐term staffing decisions. In addition, our algorithm also has at least two orders of magnitude shorter computation times than each replication of simulation. Hence, it is both fast and accurate.
- 1 November 2017
- Published by IBM in IBM Journal of Research and Development
- Vol. 61 (6) , 1:1-1:12
Effectiveness of peer detailing in a diarrhea program in Nigeria
- 1 November 2017
- Published by IBM in IBM Journal of Research and Development
- Vol. 61 (6) , 1:1-1:12
Effectiveness of peer detailing in a diarrhea program in Nigeria
- 5 October 2010
- Published by Springer Nature
- p. 185-203
Financial Uncertainty in Supply Chain Models