Journal of Jilin University (Information Science Edition) ›› 2026, Vol. 44 ›› Issue (3): 649-655.

Previous Articles     Next Articles

Shift Scheduling Algorithm for Minimizing Outpatient Waiting Time Based on Simulated Annealing

ZHOU Zongning1,2, YE Liuqi1,2, LI Jian3   

  1. 1. School of Pharmaceutical Economics and Management, Anhui University of Chinese Medicine, Hefei 230012, China; 2. Data Science and Traditional Chinese Medicine Innovation and Development, Anhui Provincial Key Laboratory of Philosophy and Social Sciences, Hefei 230012, China; 3. School of Computer Science and Technology, Zhejiang Normal University, Jinhua 321004, China
  • Received:2026-02-25 Online:2026-06-02 Published:2026-06-02

Abstract:  In order to allocate doctor resources reasonably, minimize outpatient waiting time, and improve patient experience and hospital operation efficiency, a simulated annealing based outpatient waiting time minimization scheduling algorithm is proposed. This algorithm is based on queuing theory to predict the length of outpatient waiting queues and the waiting time per unit time period, and to define a scheduling optimization decision function with the goal of minimizing waiting time. To ensure the feasibility and rationality of the decision-making objectives, multi-dimensional constraints are embedded in the algorithm, including constraints on doctors’ working time and doctor skill matching. Simulated annealing algorithm is introduced to solve the decision function and output the optimal scheduling plan through a Markov chain that iteratively generates new solutions, determines, accepts, and discards. The experimental results show that after simulating annealing algorithm scheduling, the waiting time of patients can be controlled within 16 minutes, providing practical reference for doctors’ scientific scheduling.

Key words: simulated annealing, outpatient waiting, time minimization, scheduling plan

CLC Number: 

  • TP391