Abstract

Patient appointments are an effective method to reduce patient waiting time. However, not all patients can make an appointment before receiving medical services. In this paper, we focus on the patient appointment scheduling problem in the presence of emergency patients. We formulate the problem as a stochastic programming (SP) model to reduce the patient waiting time and increase server utilisation. Considering the service system as a time-varying queuing system with dual-class patients, we propose two methods to evaluate the patients waiting times and the server utilisation for a given patient appointment schedule. The uniformisation method can ‘exactly’ evaluate the performance metrics with a high computation cost, while the trained machine learning models can approximate the metrics with high computing speed. Based on the proposed evaluation methods, we design a simulated annealing algorithm to solve the SP model. Numerical experiments show that the schedule computed by our heuristic algorithm can effectively improve the real-life patient appointment schedule.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.