Table of Contents
Fetching ...

Trustworthy and Explainable Decision-Making for Workforce allocation

Guillaume Povéda, Ryma Boumazouza, Andreas Strahl, Mark Hall, Santiago Quintana-Amate, Nahum Alvarez, Ignace Bleukx, Dimos Tsouros, Hélène Verhaeghe, Tias Guns

TL;DR

The paper tackles trustworthy, explainable workforce allocation by integrating constraint programming with interactive, user-guided infeasibility handling. It defines a CP model for assigning teams to scheduled tasks, and introduces MUS/MCS-based explainability plus conflict visualization to illuminate infeasibilities. A CPMpy-based prototype demonstrates optimization performance across instance sizes and showcases a Streamlit demonstrator for solving, refining solutions, and interactive feasibility restoration. The work highlights the potential to increase trust and acceptance of CP-based decision tools in industry, with planned user studies, interface enhancements, and extension to scheduling-shifting scenarios to address scalability and realism.

Abstract

In industrial contexts, effective workforce allocation is crucial for operational efficiency. This paper presents an ongoing project focused on developing a decision-making tool designed for workforce allocation, emphasising the explainability to enhance its trustworthiness. Our objective is to create a system that not only optimises the allocation of teams to scheduled tasks but also provides clear, understandable explanations for its decisions, particularly in cases where the problem is infeasible. By incorporating human-in-the-loop mechanisms, the tool aims to enhance user trust and facilitate interactive conflict resolution. We implemented our approach on a prototype tool/digital demonstrator intended to be evaluated on a real industrial scenario both in terms of performance and user acceptability.

Trustworthy and Explainable Decision-Making for Workforce allocation

TL;DR

The paper tackles trustworthy, explainable workforce allocation by integrating constraint programming with interactive, user-guided infeasibility handling. It defines a CP model for assigning teams to scheduled tasks, and introduces MUS/MCS-based explainability plus conflict visualization to illuminate infeasibilities. A CPMpy-based prototype demonstrates optimization performance across instance sizes and showcases a Streamlit demonstrator for solving, refining solutions, and interactive feasibility restoration. The work highlights the potential to increase trust and acceptance of CP-based decision tools in industry, with planned user studies, interface enhancements, and extension to scheduling-shifting scenarios to address scalability and realism.

Abstract

In industrial contexts, effective workforce allocation is crucial for operational efficiency. This paper presents an ongoing project focused on developing a decision-making tool designed for workforce allocation, emphasising the explainability to enhance its trustworthiness. Our objective is to create a system that not only optimises the allocation of teams to scheduled tasks but also provides clear, understandable explanations for its decisions, particularly in cases where the problem is infeasible. By incorporating human-in-the-loop mechanisms, the tool aims to enhance user trust and facilitate interactive conflict resolution. We implemented our approach on a prototype tool/digital demonstrator intended to be evaluated on a real industrial scenario both in terms of performance and user acceptability.

Paper Structure

This paper contains 20 sections, 9 figures, 2 tables.

Figures (9)

  • Figure 1: Example of Gantt chart built to visualise a solution to the workforce allocation problem
  • Figure 2: Workflow of the Decision-Making Tool
  • Figure 3: Configure the methods parameters tab
  • Figure 4: Solving tab of the app, showing the results after calling the solver.
  • Figure 5: Interactive solving tab (Manual/Automatic)
  • ...and 4 more figures

Theorems & Definitions (2)

  • Definition 1: Minimal Unsatisfiable Subset liffiton2008algorithms
  • Definition 2: Minimal Correction Subset liffiton2008algorithms