Abstract

Appointment scheduling systems represent a method to manage patient waiting lists effectively. This work advances an innovative quantitative approach for the outpatient appointment scheduling problems, based on an optimization model, to manage outpatient Day Service operations. It focuses on outpatient appointment scheduling. We start from earlier works in the literature to design models with the objective to maximize the number of patients’ appointments, to reduce patient’s waiting time, and to increase patient’s satisfaction. The proposed combinatorial problem is solved by Answer Set Programming, which is a declarative logic formalism, widely used in Artificial Intelligence and recognized as a powerful tool for Knowledge Representation and Reasoning, to show the advantages of declarative programming for modelling and fast prototyping problem requirements. We apply the model to solve real-life scenarios of the Rheumatology domain. We compare the results on the real instance already solved in our earlier work and extend the computational experiments on some new generated and realistic instances. Since the computational times increase with the size of instances, we develop a three-phase solution approach based on patient’s priority. The heuristic approach is hierarchical and enables to solve more instances than the one-run approach within the computational time limit.

Full Text
Published version (Free)

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