# The ASP-based Nurse Scheduling System at the University of Yamanashi Hospital

arXiv: https://arxiv.org/abs/2506.13600 · HTML: https://mlsanity.com/paper/2506.13600/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- Builds on 2 of its 16 references that are in the map.
- First posted on arXiv 16 Jun 2025.

## Builds on (most cited first, 2 of 2)

- [How to build your own ASP-based system?!](https://mlsanity.com/paper/2008.06692/) (2020)
- [Large Neighborhood Prioritized Search for Combinatorial Optimization with Answer Set Programming](https://mlsanity.com/paper/2405.11305/) (2024)

## Built on by (most cited first, 2 of 2)

- [EZASP - Facilitating the Usage of ASP](https://mlsanity.com/paper/2603.26863/) (2026)
- [Explainability Framework for Policy-Aware Autonomous Agents](https://mlsanity.com/paper/2607.21209/) (2026)

## Abstract (arXiv)

We present the design principles of a nurse scheduling system built using Answer Set Programming (ASP) and successfully deployed at the University of Yamanashi Hospital. Nurse scheduling is a complex optimization problem requiring the reconciliation of individual nurse preferences with hospital staffing needs across various wards. This involves balancing hard and soft constraints and the flexibility of interactive adjustments. While extensively studied in academia, real-world nurse scheduling presents unique challenges that go beyond typical benchmark problems and competitions. This paper details the practical application of ASP to address these challenges at the University of Yamanashi Hospital, focusing on the insights gained and the advancements in ASP technology necessary to effectively manage the complexities of real-world deployment.