An efficient healthcare chain design for resolving the patient scheduling problem: queuing theory and MILP-ASA optimization approach

The efficiency evaluation of the healthcare chain network becomes crucial as healthcare systems seek to enhance patient satisfaction and reduce costs during the health check. This study proposes a mixed-integer linear programming model that resolves the patient selection problem for influential diagnosis-related groups treatments by considering the approximate solution approach. This research's objective is to apply the minimum response time for the arrival time of two types of patients (regular and urgent) by presenting the Poisson distributed and queuing theory. Second, a process for resolving the optimal solutions for waiting time and the total number of patient arrival times to the hospital to achieve the target at a minimum supply chain cost. Furthermore, based on the obtained results applied for the patients with a first-come-first-serve policy and to meet overall arrival time on time, the percentage of patients waiting time at the healthcare center is reduced to under 30% for the emergency patient. At the same time, the percentage of regular patients who do not receive the treatment service time earlier and do not refer to the hospital punctuality is increased to more than 70%. Those theories determined that more healthcare costs and dissatisfaction for regular patients, while in contrast, for emergency patients, are decreased waiting time and healthcare cost services.