Distributed appointment assignment and scheduling under uncertainty

doi:10.1080/00207543.2023.2252937

Distributed appointment assignment and scheduling under uncertainty

2023-09-07

2

PRE

AI

DOI：10.1080/00207543.2023.2252937

Original

Original request for help

Save

Abstract

En 中文

We investigate a stochastic distributed appointment assignment and scheduling problem, which consists of assigning appointments to distributed service units and determining service sequences at each service unit. In particular, the service time duration and release time uncertainties are well-considered. The solution to this generic problem finds interesting applications in distributed production systems, healthcare systems, and post-disaster operations. We formulate the problem as a two-stage stochastic program to minimise the total transportation cost and expected makespan, idle time or overtime, and apply the sample average approximation method to make the problem tractable. We then develop a stochastic logic-based Benders decomposition method, decomposing the problem into a master problem and a subproblem. The master problem determines the appointment assignment variables, and the subproblem handles the sequence and service start time variables. Benders optimality cuts are generated from the subproblem's solution and added to the master problem. The developed stochastic logic-based method is advantageous since it can manage many scenarios in parallel. We further consider each appointment's due date, minimise the weighted earliness and tardiness, and adjust the developed method to solve this variant. Experiments on random instances demonstrate the excellent performance of the proposed model and methods.

Keywords:

Appointment scheduling

uncertainty

sample average approximation

stochastic programming

logic-based Benders decomposition

Distributed appointment assignment and scheduling under uncertainty

Abstract

Journal

Organization