Arik Senderovich
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Arik Senderovich has a total of 59 co-authors. Here are the top co-authors by number of shared publications:
- Opher Baron
Rotman School of Management, University of Toronto, Toronto, Ontario M5S 3E6, Canada
6 shared publications - Dmitry Krass
Rotman School of Management, University of Toronto, Toronto, Ontario M5S 3E6, Canada
5 shared publications - Avigdor Gal
Technion – Israel Institute of Technology
4 shared publications - Matthias Weidlich
Humboldt-Universität zu Berlin
4 shared publications - Artem Polyvyanyy
The University of Melbourne
3 shared publications - Andrei Tour
The University of Melbourne 3010 VIC Australia
2 shared publications
Latest Publications
- 5 October 2026
- Published by Springer Nature
- p. 219-235
BPMN+OPT: A Conceptual Modeling Language for Business Process Optimization
- 5 October 2026
- Published by Springer Nature
- p. 219-235
BPMN+OPT: A Conceptual Modeling Language for Business Process Optimization
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (10) , 7061-7079
Stochastic Process Mining: Characteristics and Challenges
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (10) , 7061-7079
Stochastic Process Mining: Characteristics and Challenges
- 22 September 2026
- Published by Springer Nature in Health Care Management Science
- Vol. 29 (4) , 44
Counterfactual prescriptions via hierarchical ML for missed chemotherapy appointment prevention
Missed medical appointments, including cancellations and no-shows, disrupt clinical workflows, reduce resource efficiency, and can compromise patient care. This study develops a machine learning (ML) framework to jointly predict cancellations and no-shows using approximately 1.8 million chemotherapy appointments from Dana-Farber Cancer Institute in Boston, Massachusetts, USA. We implement a hierarchical ML approach that first detects cancellations and then predicts no-shows among the remaining cases. Combining static appointment features with dynamic temporal features derived from prior scheduling history, the model achieves F1-scores of 0.80 (cancellations) and 0.75 (no-shows), outperforming single-stage multiclass baselines in identifying the two non-attendance outcomes. To provide actionable insights, our ML pipeline also predicts the underlying reason for a missed visit. Lacking labeled no-show reasons, we apply a semi-supervised learning approach using short-notice cancellations as proxies and achieve F1-scores of 0.60 for cancellation reasons and 0.73 for no-show reasons. Finally, we use both models to conduct a counterfactual analysis to assess whether modifiable scheduling factors – such as appointment timing and provider consistency – can reduce cancellations and missed visits. We find that interventions informed by the literature, such as patient confirmations and scheduling lead time, are less effective in this setting than previously reported. We also evaluate two model-guided operational strategies motivated by the observed prediction patterns. Our findings highlight the value of designing predictive models with prescriptive intent, particularly when the goal is to tailor interventions to the specific operational context of a medical clinic.
- 22 September 2026
- Published by Springer Nature in Health Care Management Science
- Vol. 29 (4) , 44
Counterfactual prescriptions via hierarchical ML for missed chemotherapy appointment prevention
Missed medical appointments, including cancellations and no-shows, disrupt clinical workflows, reduce resource efficiency, and can compromise patient care. This study develops a machine learning (ML) framework to jointly predict cancellations and no-shows using approximately 1.8 million chemotherapy appointments from Dana-Farber Cancer Institute in Boston, Massachusetts, USA. We implement a hierarchical ML approach that first detects cancellations and then predicts no-shows among the remaining cases. Combining static appointment features with dynamic temporal features derived from prior scheduling history, the model achieves F1-scores of 0.80 (cancellations) and 0.75 (no-shows), outperforming single-stage multiclass baselines in identifying the two non-attendance outcomes. To provide actionable insights, our ML pipeline also predicts the underlying reason for a missed visit. Lacking labeled no-show reasons, we apply a semi-supervised learning approach using short-notice cancellations as proxies and achieve F1-scores of 0.60 for cancellation reasons and 0.73 for no-show reasons. Finally, we use both models to conduct a counterfactual analysis to assess whether modifiable scheduling factors – such as appointment timing and provider consistency – can reduce cancellations and missed visits. We find that interventions informed by the literature, such as patient confirmations and scheduling lead time, are less effective in this setting than previously reported. We also evaluate two model-guided operational strategies motivated by the observed prediction patterns. Our findings highlight the value of designing predictive models with prescriptive intent, particularly when the goal is to tailor interventions to the specific operational context of a medical clinic.
- Open Access
- 3 June 2026
- Published by Springer Nature in Process Science
- Vol. 3 (1) , 13
Efficient process embedding for diffusion-based trace recovery
- 3 June 2026
- Published by Springer Nature in Process Science
- Vol. 3 (1) , 13
Open AccessEfficient process embedding for diffusion-based trace recovery
- 1 March 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 28 (2) , 517-536
Queueing Causal Models: Comparative Analytics in Queueing Systems
Problem definition: Much of the focus of queueing theory (QT) is on performance evaluation that supports comparative analytics—that is, comparing performance measures under different interventions. However, closed-form queueing models are very sensitive to assumptions. We develop a data-driven Structural Causal Queueing Model (SCQM)—a form of structural causal models that automatically adapts to the data-generating process of queueing systems, finds causal relations, and supports comparative analytics. Numerical experiments show that the accuracy of SCQM is competitive with QT, even for examples where analytical queueing solutions are available. Methodology: We employ structural causal modeling methodology that uses queueing-relevant features to develop a simulator that replicates the system’s data-generating process without requiring prior knowledge of its dynamics. We apply Machine Learning models for identifying the parent sets and causal relations. We then provide intervention analysis using Monte Carlo simulation. Managerial implications: We use queueing knowledge to develop an accurate self-adapting data-driven performance evaluator for congested systems that requires no prior knowledge of the system dynamics. Using this method, companies can perform comparative analytics of interventions for queueing systems that may not be analytically solvable. History: This paper was selected as part of the 1RR initiative between M&SOM and the MSOM Society. This paper was part of the 2024 MSOM Service Operations Service Management Special Interest Group Conference. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2024.1515 .
- 1 March 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 28 (2) , 517-536
Queueing Causal Models: Comparative Analytics in Queueing Systems
Problem definition: Much of the focus of queueing theory (QT) is on performance evaluation that supports comparative analytics—that is, comparing performance measures under different interventions. However, closed-form queueing models are very sensitive to assumptions. We develop a data-driven Structural Causal Queueing Model (SCQM)—a form of structural causal models that automatically adapts to the data-generating process of queueing systems, finds causal relations, and supports comparative analytics. Numerical experiments show that the accuracy of SCQM is competitive with QT, even for examples where analytical queueing solutions are available. Methodology: We employ structural causal modeling methodology that uses queueing-relevant features to develop a simulator that replicates the system’s data-generating process without requiring prior knowledge of its dynamics. We apply Machine Learning models for identifying the parent sets and causal relations. We then provide intervention analysis using Monte Carlo simulation. Managerial implications: We use queueing knowledge to develop an accurate self-adapting data-driven performance evaluator for congested systems that requires no prior knowledge of the system dynamics. Using this method, companies can perform comparative analytics of interventions for queueing systems that may not be analytically solvable. History: This paper was selected as part of the 1RR initiative between M&SOM and the MSOM Society. This paper was part of the 2024 MSOM Service Operations Service Management Special Interest Group Conference. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2024.1515 .
- Open Access
DDTR: Diffusion Denoising Trace Recovery
With recent technological advances, process logs, which were traditionally deterministic in nature, are being captured from non-deterministic sources, such as uncertain sensors or machine learning models (that predict activities using cameras). In the presence of stochastically-known logs, logs that contain probabilistic information, the need for stochastic trace recovery increases, to offer reliable means of understanding the processes that govern such systems. We design a novel deep learning approach for stochastic trace recovery, based on Diffusion Denoising Probabilistic Models (DDPM), which makes use of process knowledge (either implicitly by discovering a model or explicitly by injecting process knowledge in the training phase) to recover traces by denoising. We conduct an empirical evaluation demonstrating state-of-the-art performance with up to a 25% improvement over existing methods, along with increased robustness under high noise levels.
Open AccessDDTR: Diffusion Denoising Trace Recovery
With recent technological advances, process logs, which were traditionally deterministic in nature, are being captured from non-deterministic sources, such as uncertain sensors or machine learning models (that predict activities using cameras). In the presence of stochastically-known logs, logs that contain probabilistic information, the need for stochastic trace recovery increases, to offer reliable means of understanding the processes that govern such systems. We design a novel deep learning approach for stochastic trace recovery, based on Diffusion Denoising Probabilistic Models (DDPM), which makes use of process knowledge (either implicitly by discovering a model or explicitly by injecting process knowledge in the training phase) to recover traces by denoising. We conduct an empirical evaluation demonstrating state-of-the-art performance with up to a 25% improvement over existing methods, along with increased robustness under high noise levels.
- Open Access
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 10, 8572-8581
Proactive Data-driven Scheduling of Business Processes
Proactive scheduling creates robust offline schedules that optimize resource utilization and minimize job flow times. This work addresses scheduling challenges in business processes, often encountered in service systems, which differ from traditional applications like manufacturing due to inherent uncertainties in activity durations, and human resource availability. We model the business process scheduling problem (BPSP) as a variation of stochastic resource-constrained multi-project scheduling (RCMPSP), and apply process mining to infer unknown parameter values from historical event data. To overcome the randomness in activity durations, we transform the problem into its deterministic counterpart, and prove that the latter provides a lower bound on the Makespan of the stochastic problem. Our approach integrates data-driven Monte Carlo simulation with constraint programming to generate proactive schedules that guarantee, with high probability, that the Makespan remains below a predefined threshold. We evaluate our approach using synthetic datasets with varying levels of uncertainty and size. In addition, we apply the approach to a real-world dataset from an outpatient cancer hospital, demonstrating its effectiveness in optimizing the process Makespan by an average of 5% to 14%.
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 10, 8572-8581
Open AccessProactive Data-driven Scheduling of Business Processes
Proactive scheduling creates robust offline schedules that optimize resource utilization and minimize job flow times. This work addresses scheduling challenges in business processes, often encountered in service systems, which differ from traditional applications like manufacturing due to inherent uncertainties in activity durations, and human resource availability. We model the business process scheduling problem (BPSP) as a variation of stochastic resource-constrained multi-project scheduling (RCMPSP), and apply process mining to infer unknown parameter values from historical event data. To overcome the randomness in activity durations, we transform the problem into its deterministic counterpart, and prove that the latter provides a lower bound on the Makespan of the stochastic problem. Our approach integrates data-driven Monte Carlo simulation with constraint programming to generate proactive schedules that guarantee, with high probability, that the Makespan remains below a predefined threshold. We evaluate our approach using synthetic datasets with varying levels of uncertainty and size. In addition, we apply the approach to a real-world dataset from an outpatient cancer hospital, demonstrating its effectiveness in optimizing the process Makespan by an average of 5% to 14%.
- 1 December 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Service Science
- Vol. 16 (4) , 351-352
Call for Papers: Special Issue on Service Engineering: Data-Driven Service Design and Optimization
- 1 December 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Service Science
- Vol. 16 (4) , 351-352
Call for Papers: Special Issue on Service Engineering: Data-Driven Service Design and Optimization
- 30 August 2024
- Published by Springer Nature
- p. 90-106
Data-Driven Decision Support for Business Processes: Causal Reasoning and Discovery
- 30 August 2024
- Published by Springer Nature
- p. 90-106
Data-Driven Decision Support for Business Processes: Causal Reasoning and Discovery
- 1 May 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 36 (3) , 766-786
Supervised ML for Solving the GI/GI/1 Queue
We apply supervised learning to a general problem in queueing theory: using a neural net, we develop a fast and accurate predictor of the stationary system-length distribution of a GI/GI/1 queue—a fundamental queueing model for which no analytical solutions are available. To this end, we must overcome three main challenges: (i) generating a large library of training instances that cover a wide range of arbitrary interarrival and service time distributions, (ii) labeling the training instances, and (iii) providing continuous arrival and service distributions as inputs to the neural net. To overcome (i), we develop an algorithm to sample phase-type interarrival and service time distributions with complex transition structures. We demonstrate that our distribution-generating algorithm indeed covers a wide range of possible positive-valued distributions. For (ii), we label our training instances via quasi-birth-and-death(QBD) that was used to approximate PH/PH/1 (with phase-type arrival and service process) as labels for the training data. For (iii), we find that using only the first five moments of both the interarrival and service times distribution as inputs is sufficient to train the neural net. Our empirical results show that our neural model can estimate the stationary behavior of the GI/GI/1—far exceeding other available methods in terms of both accuracy and runtimes. History: Ram Ramesh, Area Editor for Data Science and Machine Learning. Funding: O. Baron received financial support from the Natural Sciences and Engineering Research Council of Canada (NERC) [Grant 458051]. D. Krass received financial support from the NERC [Grant 458395]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0263 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0263 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 1 May 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 36 (3) , 766-786
Supervised ML for Solving the GI/GI/1 Queue
We apply supervised learning to a general problem in queueing theory: using a neural net, we develop a fast and accurate predictor of the stationary system-length distribution of a GI/GI/1 queue—a fundamental queueing model for which no analytical solutions are available. To this end, we must overcome three main challenges: (i) generating a large library of training instances that cover a wide range of arbitrary interarrival and service time distributions, (ii) labeling the training instances, and (iii) providing continuous arrival and service distributions as inputs to the neural net. To overcome (i), we develop an algorithm to sample phase-type interarrival and service time distributions with complex transition structures. We demonstrate that our distribution-generating algorithm indeed covers a wide range of possible positive-valued distributions. For (ii), we label our training instances via quasi-birth-and-death(QBD) that was used to approximate PH/PH/1 (with phase-type arrival and service process) as labels for the training data. For (iii), we find that using only the first five moments of both the interarrival and service times distribution as inputs is sufficient to train the neural net. Our empirical results show that our neural model can estimate the stationary behavior of the GI/GI/1—far exceeding other available methods in terms of both accuracy and runtimes. History: Ram Ramesh, Area Editor for Data Science and Machine Learning. Funding: O. Baron received financial support from the Natural Sciences and Engineering Research Council of Canada (NERC) [Grant 458051]. D. Krass received financial support from the NERC [Grant 458395]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0263 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0263 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .