Scheduling is a fundamental optimisation problem that has a wide range of practical applications. Mathematical formulations of scheduling problems allow for development of efficient solvers. Yet, the same mathematical intricacies often make solvers black-boxes: their outcomes are hardly explainable and interactive even to experts, let alone lay users. Still, in real-world applications as well as research environments, lay users and experts likewise require a means to understand why a schedule is reasonable and what would happen with different schedules. Building upon a recently proposed approach to argumentation-supported explainable scheduling, we present a tool, Schedule Explainer, that provides interactive explanations in makespan scheduling easily and with clarity.
CITATION STYLE
Čyras, K., Lee, M., & Letsios, D. (2021). Schedule Explainer: An Argumentation-Supported Tool for Interactive Explanations in Makespan Scheduling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12688 LNAI, pp. 243–259). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-82017-6_15
Mendeley helps you to discover research relevant for your work.