Abstract

This paper addressed a scheduling problem which handles urgent tasks along with existing schedules. The uncertainties in this problem come from random process of existing schedules and unknown upcoming urgent tasks. To deal with the uncertainties, this paper proposes a stochastic integer programming (SIP) based aggregated online scheduling method. The method is illustrated through a study case from the outpatient clinic block-wise scheduling system which is under a hybrid scheduling policy combining regular far-in-advance policy and the open-access policy. The COVID-19 pandemic brings more challenges for the healthcare system including the fluctuations of service time and increasing urgent requests which this paper is designed for. The schedule framework designed in the method is comprehensive to accommodate various uncertainties in the healthcare service system, such as: no-shows, cancellations and punctuality of patients as well as preference of patients over time slots and physicians.Supplementary InformationThe online version contains supplementary material available at 10.1007/s43069-021-00089-6.

Highlights

  • Unscheduled jobs that need prompt services often complicate a scheduling problem

  • We proposed a framework where the stochastic integer programming is the base which contains the robust optimization as a special case

  • This paper suggests the clinic administrators who are practicing the open-access policy and block-wise assignment to adopt the aggregated assignment with stochastic integer programming (SIP) model

Read more

Summary

Introduction

Unscheduled jobs that need prompt services often complicate a scheduling problem. This is a common problem in several industries. The unscheduled repairs of airplanes, automobiles and locomotives; or unscheduled visit of patients/customers; or breaking news for broadcasting industry.

43 Page 2 of 32
43 Page 4 of 32
Literature Review
43 Page 6 of 32
43 Page 8 of 32
Assumptions
Notation
Formulations
43 Page 12 of 32
Two‐Stage Integer Stochastic Programming Model for Multiple Physicians
Robust Optimization Model for One Block with One Physician
43 Page 16 of 32
Deterministic Equivalent Problem
Distribution of Random Variables in DEP‐i
Bound‐Based Sampling Method
43 Page 20 of 32
Comparison of DEP‐i and RO‐i
The Aggregate Assignment Method
43 Page 24 of 32
Importance of Request Estimation
43 Page 26 of 32
Objective
Further Sensitivity Analysis
43 Page 28 of 32
Conclusions
43 Page 30 of 32
Findings
43 Page 32 of 32
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