Ivo Adan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ivo Adan has a total of 121 co-authors. Here are the top co-authors by number of shared publications:
- Quang-Vinh Dang
Eindhoven University of Technology
9 shared publications - Alp Akcay
Department of Mechanical and Industrial Engineering, Northeastern University
8 shared publications - Zümbül Atan
Department of Industrial Engineering and Innovation Sciences Eindhoven University of Technology Eindhoven The Netherlands
8 shared publications - Jeroen Middelhuis
Eindhoven University of Technology,Department of Industrial Engineering and Innovation Sciences
5 shared publications - Tugce Martagan
Northeastern University
5 shared publications - Vidyadhar G. Kulkarni
Department of Statistics and Operations Research, University of North Carolina, Chapel Hill, USA
5 shared publications
Latest Publications
- 21 September 2026
- Published by Springer Nature
- p. 91-106
Forecasting Exogenous Waste Inflow: A Two-Regime Hierarchical Approach for Circular Battery Manufacturing
- 21 September 2026
- Published by Springer Nature
- p. 91-106
Forecasting Exogenous Waste Inflow: A Two-Regime Hierarchical Approach for Circular Battery Manufacturing
- Open Access
- 18 September 2026
- Published by Elsevier in SSRN Electronic Journal
Diagnosing Processes with Complex Dependencies: Constraint-Aware Counterfactual Explanations for Object-Centric Process Executions
Business processes are vital to an organisation. Occasionally, those processes lead to undesired outcomes such as delays, quality issues, excessive costs, or low throughput, often caused by complex dependencies between process conditions and resources. Identifying the underlying causes of the process outcomes enables targeted process improvements, a form of post-hoc decision support in which, given an unfavourable completed execution, the system proposes a small set of high-impact, evidence-based changes to improve future process outcomes. Counterfactual explanation is a promising technique to provide such decision support. However, existing techniques lack the ability to deal with constraints specific to processes with complex dependencies. In this work, we propose a counterfactual decision support approach leveraging the object-centric process modelling paradigm to explain how a process execution must be modified to change its outcome to a desired one. The resulting explanations are constrained by the underlying process and domain rules to ensure that the suggested explanations are feasible, actionable, and minimally invasive. The proposed approach is evaluated on multiple synthetic and real-world process datasets and benchmarked against a method for generating generic graph counterfactuals. The results demonstrate that our approach is effective in generating minimal counterfactual explanations and outperforms the tested competitor.
- 18 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessDiagnosing Processes with Complex Dependencies: Constraint-Aware Counterfactual Explanations for Object-Centric Process Executions
Business processes are vital to an organisation. Occasionally, those processes lead to undesired outcomes such as delays, quality issues, excessive costs, or low throughput, often caused by complex dependencies between process conditions and resources. Identifying the underlying causes of the process outcomes enables targeted process improvements, a form of post-hoc decision support in which, given an unfavourable completed execution, the system proposes a small set of high-impact, evidence-based changes to improve future process outcomes. Counterfactual explanation is a promising technique to provide such decision support. However, existing techniques lack the ability to deal with constraints specific to processes with complex dependencies. In this work, we propose a counterfactual decision support approach leveraging the object-centric process modelling paradigm to explain how a process execution must be modified to change its outcome to a desired one. The resulting explanations are constrained by the underlying process and domain rules to ensure that the suggested explanations are feasible, actionable, and minimally invasive. The proposed approach is evaluated on multiple synthetic and real-world process datasets and benchmarked against a method for generating generic graph counterfactuals. The results demonstrate that our approach is effective in generating minimal counterfactual explanations and outperforms the tested competitor.
- 18 September 2026
- Published by Springer Nature
- p. 285-299
Integrated Machine-Robot Scheduling in a Job Shop: An ILS Algorithm
- 18 September 2026
- Published by Springer Nature
- p. 285-299
Integrated Machine-Robot Scheduling in a Job Shop: An ILS Algorithm
- Open Access
- 2 September 2026
- Published by Elsevier in SSRN Electronic Journal
Explainable Resource Allocation in Business Processes
Allocating the right resource to perform a task for a case is essential forthe efficient execution of business processes. Traditionally, simple rule-basedheuristics, such as Shortest Processing Time (SPT) and First-In-First-Out(FIFO), are used for this purpose. These heuristics are easy to understandand explain, but their effectiveness depends strongly on process characteristicsand goals. Recently, Deep Reinforcement Learning (DRL) approacheshave been developed to learn effective policies for resource allocation problems.While these methods can improve performance, they produce blackboxpolicies that are difficult to interpret and explain, limiting their practicaladoption. This paper introduces a method for learning explainable resourceallocationpolicies that combines the strengths of rule-based heuristics andDRL. The approach uses DRL to learn a policy that selects the most suitableheuristic for each process state and then applies a post-hoc explanation stepthat distills the learned policy into a decision tree. The resulting policy canbe expressed as human-readable rules, such as selecting SPT when processingtimes are high and FIFO otherwise. We evaluate the DRL policy and thedistilled decision-tree policies on six synthetic and five real-world businessprocesses. The DRL approach matches or outperforms the best individualheuristic in all considered, demonstrating the effectiveness and scalability ofadaptive heuristic selection. Moreover, in most cases, the distilled decisiontreematches the performance of the original DRL policy while providingtransparent and executable decision rules.
- 2 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessExplainable Resource Allocation in Business Processes
Allocating the right resource to perform a task for a case is essential forthe efficient execution of business processes. Traditionally, simple rule-basedheuristics, such as Shortest Processing Time (SPT) and First-In-First-Out(FIFO), are used for this purpose. These heuristics are easy to understandand explain, but their effectiveness depends strongly on process characteristicsand goals. Recently, Deep Reinforcement Learning (DRL) approacheshave been developed to learn effective policies for resource allocation problems.While these methods can improve performance, they produce blackboxpolicies that are difficult to interpret and explain, limiting their practicaladoption. This paper introduces a method for learning explainable resourceallocationpolicies that combines the strengths of rule-based heuristics andDRL. The approach uses DRL to learn a policy that selects the most suitableheuristic for each process state and then applies a post-hoc explanation stepthat distills the learned policy into a decision tree. The resulting policy canbe expressed as human-readable rules, such as selecting SPT when processingtimes are high and FIFO otherwise. We evaluate the DRL policy and thedistilled decision-tree policies on six synthetic and five real-world businessprocesses. The DRL approach matches or outperforms the best individualheuristic in all considered, demonstrating the effectiveness and scalability ofadaptive heuristic selection. Moreover, in most cases, the distilled decisiontreematches the performance of the original DRL policy while providingtransparent and executable decision rules.
- Open Access
- 2 July 2026
- Published by Elsevier in European Journal of Operational Research
A matheuristic for integrated scheduling of manufacturing assembly, product transport, and material supply
- 2 July 2026
- Published by Elsevier in European Journal of Operational Research
Open AccessA matheuristic for integrated scheduling of manufacturing assembly, product transport, and material supply
- Open Access
- 14 February 2026
- Published by Elsevier in SSRN Electronic Journal
A Reference Model and Patterns for Production Event Data Enrichment
With the advent of digital transformation, organisations are increasingly generatinglarge volumes of data through the execution of various processesacross disparate systems. By integrating and aggregating data from theseheterogeneous sources, it becomes possible to derive new insights essential fortasks such as monitoring and analysing process performance. Typically, thisinformation is extracted during a data pre-processing or engineering phase.However, this step is often performed in an ad-hoc manner and is time consumingand labour-intensive. To streamline this process, we introducea reference model and a collection of patterns designed to enrich productionevent data. The reference model provides a standard way to store andextract production event data. The patterns describe common data aggregationand information extraction tasks. The reference model is constructed bycombining the ISA-95 industry standard with the Event Knowledge Graphformalism. The patterns are developed based on empirical observations fromevent data sets originating in manufacturing processes and are formalisedusing the reference model. The ability of the proposed patterns to acceleratedata aggregation and facilitate knowledge exchange has been validatedthrough an empirical evaluation involving manufacturing professionals fromdifferent roles and production environments.
- 14 February 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessA Reference Model and Patterns for Production Event Data Enrichment
With the advent of digital transformation, organisations are increasingly generatinglarge volumes of data through the execution of various processesacross disparate systems. By integrating and aggregating data from theseheterogeneous sources, it becomes possible to derive new insights essential fortasks such as monitoring and analysing process performance. Typically, thisinformation is extracted during a data pre-processing or engineering phase.However, this step is often performed in an ad-hoc manner and is time consumingand labour-intensive. To streamline this process, we introducea reference model and a collection of patterns designed to enrich productionevent data. The reference model provides a standard way to store andextract production event data. The patterns describe common data aggregationand information extraction tasks. The reference model is constructed bycombining the ISA-95 industry standard with the Event Knowledge Graphformalism. The patterns are developed based on empirical observations fromevent data sets originating in manufacturing processes and are formalisedusing the reference model. The ability of the proposed patterns to acceleratedata aggregation and facilitate knowledge exchange has been validatedthrough an empirical evaluation involving manufacturing professionals fromdifferent roles and production environments.
- 3 February 2026
- Published by Springer Nature
- p. 173-190
Learning to Allocate: Dynamic Heuristic Selection for Business Processes
- 3 February 2026
- Published by Springer Nature
- p. 173-190
Learning to Allocate: Dynamic Heuristic Selection for Business Processes
- 21 November 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 330 (1) , 157-168
Admission control for service systems with impatient customers: Value of information
- 21 November 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 330 (1) , 157-168
Admission control for service systems with impatient customers: Value of information
- Open Access
- 1 October 2025
- Published by Elsevier in Reliability Engineering & System Safety
- Vol. 266
Deep reinforcement learning for optimal planning of production line maintenance with deterioration
- 1 October 2025
- Published by Elsevier in Reliability Engineering & System Safety
- Vol. 266
Open AccessDeep reinforcement learning for optimal planning of production line maintenance with deterioration
- 27 August 2025
- Published by Springer Nature
- p. 256-273
A Rollout-Based Algorithm and Reward Function for Resource Allocation in Business Processes
- 27 August 2025
- Published by Springer Nature
- p. 256-273
A Rollout-Based Algorithm and Reward Function for Resource Allocation in Business Processes