강화학습을 활용한 분자진단 통합자동화 시스템의 동적 스케줄링 최적화
There is a growing need for adaptive operational control to manage stochastic sample arrivals and strict turnaround deadlines in molecular diagnostics systems. Conventional static dispatching rules, however, often struggle to accommodate sudden surges in urgent samples, leading to bottleneck propagation across serial diagnostic processes. The primary objective of this study is to develop a multi-agent reinforcement learning framework for dynamic scheduling within a discrete event simulation environment. In this framework, independent deep Q-network agents at six serial diagnostic stages dynamically select from three dispatching rules―first-in-first-out, urgent-first, and earliest due date. These decisions are based on continuous-state observations of queue congestion, urgency mix, and remaining deadline, with hyperparameters determined through random search. The simulation environment was preliminarily validated by comparing Gantt-chart-based field schedules with simulation outcomes using a paired t-test. The proposed model was evaluated against a rule-based baseline, a genetic algorithm policy, and a tabular Q-learning model under three urgency-ratio regimes. During overload scenarios, the proposed framework demonstrated a statistically significant improvement in the high-urgency on-time rate compared to the rule-based baseline, while simultaneously reducing average waiting times. The genetic algorithm converged to a static, rule-equivalent mapping, whereas the critical-urgency on-time rate remained consistent across all four models. Overall, these results imply that continuous-state multi-agent reinforcement learning provides superior adaptive responsiveness in high-load regimes. Future research should focus on extending this framework to facility-level dispatching to address load imbalance among parallel machines.