4.7 Article

Coordinated appointment scheduling with multiple providers and patient-and-physician matching cost in specialty care * , **

Journal

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.omega.2020.102285

Keywords

Health care; Benders decomposition; Appointment scheduling; Multiple service providers; Patient-and-physician matching

Funding

  1. Science and Technology Foundation of Jiangxi Educational Committee [GJJ190287]
  2. NSFC [71801051]
  3. Omron research fund

Ask authors/readers for more resources

This study improves patient-and-physician matching and appointment scheduling in specialty care by developing a stochastic optimization model to minimize operational costs. Results show that matching significantly impacts operational costs, and the proposed algorithm provides efficient solutions for medium to large-size problems compared to traditional methods.
To achieve effective care, it is critical to match patients with capable physicians in specialty care. Motivated by the rising popularity of patient-and-physician matching applications in specialty care, this study optimizes the matching and appointment scheduling problems simultaneously in a stochastic environment, in which a decision-maker determines the patient-and-physician pair assignment and the starting times of services. We develop a stochastic optimization model to minimize the matching and operational costs (i.e., patients' waiting time costs, service providers' idle time and overtime costs). This paper is the first study that incorporates matching and appointment scheduling problems together. The benefits of combining these two problems are enormous. The experimental results show that the operational costs gap is as large as 51% between the ill-matched and the well-matched patient-and-physician scenarios. We first reformulate this problem as a two-stage optimization problem. With the analysis for the optimal solution of the second stage problem, a Benders decomposition algorithm is developed. To improve the efficiency of the proposed algorithm, we also prove a low bound of our problem and use it to construct a set of feasibility cuts. Then, we extend our method to incorporate no-shows. Our algorithm can solve problems efficiently, and it can obtain optimal solutions for medium-size problems within 2 or 3 min. In contrast, traditional optimal methods require nearly 2 h. For large-size problems, our algorithm can obtain optimal solutions within 5 or 6 min, whereas traditional optimal methods cannot generate a result within 5 h. Finally, numerical experiments are conducted to evaluate the performance of our proposed algorithm and to investigate the variation of the optimal solutions in different scenarios. To provide quality care as well as minimize the total cost of appointment scheduling in specialty care, we suggest that physicians should develop or train their specialties based on the local patients' disease pattern. We also disclose that the no-show has less influence on the service system when the weight of the matching cost is substantial.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available