Search arXivSearch

arXiv · 2507.05182

A Two-Stage Scheduling Method for Nurse Scheduling and Its Practical Application

Abstract

The creation of nurses' schedules is a critical task that directly impacts the quality and safety of patient care as well as the quality of life for nurses. In most hospitals in Japan, this responsibility falls to the head nurse of each ward. The physical and mental burden of this task is considerable, and recent challenges such as the growing shortage of nurses and increasingly diverse working styles have further complicated the scheduling process. Consequently, there is a growing demand for automated nurse scheduling systems. Technically, modern integer programming solvers can generate feasible schedules within a practical timeframe. However, in many hospitals, schedules are still created manually. This is largely because tacit knowledge, considerations unconsciously applied by head nurses, cannot be fully formalized into explicit constraints, often resulting in automatically generated schedules that are not practically usable. To address this issue, we propose a novel "two-stage scheduling method." This approach divides the scheduling task into night shift and day shift stages, allowing head nurses to make manual adjustments after the first stage. This interactive process makes it possible to produce nurse schedules that are suitable for real-world implementation. Furthermore, to promote the practical adoption of nurse scheduling, we present case studies from acute and chronic care hospitals where systems based on the proposed method were deployed. We also discuss the challenges encountered during implementation and the corresponding solutions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Keisuke Nakashima, Kohei Furuike, Yoshiaki Inoue. 2025-07-07. A Two-Stage Scheduling Method for Nurse Scheduling and Its Practical Application. https://arxiv.org/abs/2507.05182

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Strategic Inference in Stackelberg Games: Optimal Control for Revealing Adversary Intent

We study a continuous-time stochastic Stackelberg game in which a leader seeks to accomplish a primary objective while inferring a hidden parameter of a rational follower. The follower solves an entropy-regularized linear-quadratic tracking problem and responds to the leader's trajectory with a randomized policy. Anticipating this response, the leader designs informative controls to maximize the estimation efficiency for the follower's latent intent, through maximum likelihood estimation. Unlike prior work on discrete-time or finite-candidate inverse learning, our framework enables continuous parameter inference without prior assumptions and endogenizes the information source through the follower's strategic feedback. We derive semi-explicit solutions, prove well-posedness, and develop recurrent neural network algorithms to approximate the leader's path-dependent control. Numerical experiments demonstrate how the leader balances task performance and information gain, highlighting the practical value of our approach for adversarial strategic inference.

math.OC

Stratification for Nonlinear Semidefinite Programming

This paper introduces a stratification framework for nonlinear semidefinite programming (NLSDP) that reveals and utilizes the geometry behind the nonsmooth KKT system. Based on the index stratification of $\mathbb{S}^n$ and its lift to the primal-dual space, a stratified variational analysis is developed. Specifically, we define the stratum-restricted regularity property, characterize it by the verifiable weak second order condition (W-SOC) and weak strict Robinson constraint qualification (W-SRCQ), and interpret the W-SRCQ geometrically via transversality, with stability along strata. The interactions of these properties across neighboring strata are further examined, leading to the conclusion that classical strong-form regularity conditions correspond to the local uniform validity of stratum-restricted counterparts. On the algorithmic side, a stratified Gauss--Newton method with normal steps and a correction mechanism is proposed for globally solving the KKT equation through a least-squares merit function. We demonstrate that the algorithm converges globally to directional stationary points. Moreover, under the second order sufficient condition (SOSC) and the strict Robinson constraint qualification (SRCQ) at an accumulation point, with a suitable correction threshold, the whole sequence converges superlinearly to this point, which is a KKT pair, and eventually identifies the active stratum. The rate is quadratic if the problem data are additionally of class $LC^2$ near the solution.

math.OC

Convergence Rate Analysis of SOAP with Arbitrary Orthogonal Projection Matrices

In this short note, we establish, for the first time, the convergence rate of SOAP, an efficient and popular matrix-based optimizer for training deep neural networks. Our analysis extends to a more general variant of SOAP that admits arbitrary orthogonal projection matrices and requires only that these matrices be conditionally independent of the current stochastic gradient at each iteration. For example, they may be constructed from information available up to the preceding step.

math.OC