Fast approximation methods for online scheduling of outpatient procedure centers

Bjorn P. Berg, Brian T. Denton

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

This paper presents a new model for online decision making. Motivated by the healthcare delivery application of dynamically allocating patients to procedure rooms in outpatient procedure centers, the online stochastic extensible bin-packing problem is described. The objective is to minimize the combined costs of opening procedure rooms and utilizing overtime to complete a day's procedures. The dynamic patient-allocation decisions are made in an uncertain environment where the number of patients scheduled and the procedure durations are not known in advance. The resulting optimization model's tractability focuses the paper's attention on approximation methods and a special case that is amenable to decomposition-based solution methods. Theoretical performance guarantees are presented for list-based approximation methods as well as an approximation that is common in practice, where procedure rooms are reserved for patient groups in advance. Numerical results based on a real outpatient procedure center demonstrate the favorable results of the list-based approximations based on their average and worst case performances, as well as their computational requirements. Further, the numerical experiments show that the policy of reserving procedure rooms for patient groups in advance can perform poorly. These results are contrary to common practice and favor alternative, and still easy-to-implement, policies.

Original languageEnglish (US)
Pages (from-to)631-644
Number of pages14
JournalINFORMS Journal on Computing
Volume29
Issue number4
DOIs
StatePublished - Sep 1 2017

Fingerprint

Scheduling
Bins
Decision making
Decomposition
Costs
Experiments
Approximation
Outpatient

Keywords

  • Healthcare: Outpatient procedure centers
  • Scheduling: Approximations
  • Stochastic programming

Cite this

Fast approximation methods for online scheduling of outpatient procedure centers. / Berg, Bjorn P.; Denton, Brian T.

In: INFORMS Journal on Computing, Vol. 29, No. 4, 01.09.2017, p. 631-644.

Research output: Contribution to journalArticle

@article{65ef9c4f8a1a4608acb02a978e736ce6,
title = "Fast approximation methods for online scheduling of outpatient procedure centers",
abstract = "This paper presents a new model for online decision making. Motivated by the healthcare delivery application of dynamically allocating patients to procedure rooms in outpatient procedure centers, the online stochastic extensible bin-packing problem is described. The objective is to minimize the combined costs of opening procedure rooms and utilizing overtime to complete a day's procedures. The dynamic patient-allocation decisions are made in an uncertain environment where the number of patients scheduled and the procedure durations are not known in advance. The resulting optimization model's tractability focuses the paper's attention on approximation methods and a special case that is amenable to decomposition-based solution methods. Theoretical performance guarantees are presented for list-based approximation methods as well as an approximation that is common in practice, where procedure rooms are reserved for patient groups in advance. Numerical results based on a real outpatient procedure center demonstrate the favorable results of the list-based approximations based on their average and worst case performances, as well as their computational requirements. Further, the numerical experiments show that the policy of reserving procedure rooms for patient groups in advance can perform poorly. These results are contrary to common practice and favor alternative, and still easy-to-implement, policies.",
keywords = "Healthcare: Outpatient procedure centers, Scheduling: Approximations, Stochastic programming",
author = "Berg, {Bjorn P.} and Denton, {Brian T.}",
year = "2017",
month = "9",
day = "1",
doi = "10.1287/ijoc.2017.0750",
language = "English (US)",
volume = "29",
pages = "631--644",
journal = "ORSA journal on computing",
issn = "0899-1499",
publisher = "Operations Research Society of America",
number = "4",

}

TY - JOUR

T1 - Fast approximation methods for online scheduling of outpatient procedure centers

AU - Berg, Bjorn P.

AU - Denton, Brian T.

PY - 2017/9/1

Y1 - 2017/9/1

N2 - This paper presents a new model for online decision making. Motivated by the healthcare delivery application of dynamically allocating patients to procedure rooms in outpatient procedure centers, the online stochastic extensible bin-packing problem is described. The objective is to minimize the combined costs of opening procedure rooms and utilizing overtime to complete a day's procedures. The dynamic patient-allocation decisions are made in an uncertain environment where the number of patients scheduled and the procedure durations are not known in advance. The resulting optimization model's tractability focuses the paper's attention on approximation methods and a special case that is amenable to decomposition-based solution methods. Theoretical performance guarantees are presented for list-based approximation methods as well as an approximation that is common in practice, where procedure rooms are reserved for patient groups in advance. Numerical results based on a real outpatient procedure center demonstrate the favorable results of the list-based approximations based on their average and worst case performances, as well as their computational requirements. Further, the numerical experiments show that the policy of reserving procedure rooms for patient groups in advance can perform poorly. These results are contrary to common practice and favor alternative, and still easy-to-implement, policies.

AB - This paper presents a new model for online decision making. Motivated by the healthcare delivery application of dynamically allocating patients to procedure rooms in outpatient procedure centers, the online stochastic extensible bin-packing problem is described. The objective is to minimize the combined costs of opening procedure rooms and utilizing overtime to complete a day's procedures. The dynamic patient-allocation decisions are made in an uncertain environment where the number of patients scheduled and the procedure durations are not known in advance. The resulting optimization model's tractability focuses the paper's attention on approximation methods and a special case that is amenable to decomposition-based solution methods. Theoretical performance guarantees are presented for list-based approximation methods as well as an approximation that is common in practice, where procedure rooms are reserved for patient groups in advance. Numerical results based on a real outpatient procedure center demonstrate the favorable results of the list-based approximations based on their average and worst case performances, as well as their computational requirements. Further, the numerical experiments show that the policy of reserving procedure rooms for patient groups in advance can perform poorly. These results are contrary to common practice and favor alternative, and still easy-to-implement, policies.

KW - Healthcare: Outpatient procedure centers

KW - Scheduling: Approximations

KW - Stochastic programming

UR - http://www.scopus.com/inward/record.url?scp=85034816071&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85034816071&partnerID=8YFLogxK

U2 - 10.1287/ijoc.2017.0750

DO - 10.1287/ijoc.2017.0750

M3 - Article

AN - SCOPUS:85034816071

VL - 29

SP - 631

EP - 644

JO - ORSA journal on computing

JF - ORSA journal on computing

SN - 0899-1499

IS - 4

ER -