Abstract
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.
At the time of writing this paper, all the authors were affiliated with Imperial College London but no longer belong to this institution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
- 2.
- 3.
This slightly relaxes the notion of fixed decisions from [4] to accommodate for ill-posed user queries, allowing explanations over validations of the user input too, useful in practical applications. For instance, if fixed decisions are not satisfiable, then that should be explained.
- 4.
- 5.
- 6.
References
Makhorin, A.: GLPK (GNU Linear Programming Kit) (2000). https://www.gnu.org/software/glpk/. Accessed 28 Feb 2021
Charwat, G., Dvořák, W., Gaggl, S., Wallner, J.P., Woltran, S.: Methods for solving reasoning problems in abstract argumentation - a survey. Artif. Intell. 220, 28–63 (2015). https://doi.org/10.1016/j.artint.2014.11.008
Čyras, K., Karamlou, A., Lee, M., Letsios, D., Misener, R., Toni, F.: AI-assisted Schedule Explainer for Nurse Rostering. In: Seghrouchni, A.E.F., Sukthankar, G., An, B., Yorke-Smith, N. (eds.) 19th International Conference on Autonomous Agents and MultiAgent Systems - Demo Track, pp. 2101–2103. IFAAMAS, Auckland (2020)
Čyras, K., Letsios, D., Misener, R., Toni, F.: Argumentation for explainable scheduling. In: 33rd AAAI Conference on Artificial Intelligence. AAAI Press, Honolulu (2019)
Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77, 321–357 (1995). https://doi.org/10.1016/0004-3702(94)00041-X
Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17(2), 416–429 (1969)
Laborie, P., Rogerie, J., Shaw, P., Vilím, P.: IBM ILOG CP optimizer for scheduling. Constraints 23(2), 210–250 (2018). https://doi.org/10.1007/s10601-018-9281-x
Pinedo, M.L., Chao, X., Leung, J., Feldman, A.: Lekin scheduling system. http://web-static.stern.nyu.edu/om/software/lekin/index.htm (2010). Accessed 28 Feb 2021
Rahwan, I., Simari, G.R.: Argumentation in Artificial Intelligence. SpringerSpringer, New York (2009). https://doi.org/10.1007/978-0-387-98197-0
Sacchi, L., et al.: From decision to shared-decision: introducing patients’ preferences into clinical decision analysis. Artif. Intell. Med. 65(1), 19–28 (2015). https://doi.org/10.1016/j.artmed.2014.10.004
Setmore: Free online appointment scheduling calender software (2019). https://www.setmore.com/. Accessed 28 Feb 2021
Warner, D.M., Prawda, J.: A Mathematical programming model for scheduling nursing personnel in a hospital. Manage. Sci. 19(4), 411–422 (1972). http://www.jstor.org/stable/2629025
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Čyras, K., Lee, M., Letsios, D. (2021). Schedule Explainer: An Argumentation-Supported Tool for Interactive Explanations in Makespan Scheduling. In: Calvaresi, D., Najjar, A., Winikoff, M., Främling, K. (eds) Explainable and Transparent AI and Multi-Agent Systems. EXTRAAMAS 2021. Lecture Notes in Computer Science(), vol 12688. Springer, Cham. https://doi.org/10.1007/978-3-030-82017-6_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-82017-6_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-82016-9
Online ISBN: 978-3-030-82017-6
eBook Packages: Computer ScienceComputer Science (R0)