Fast approximation methods for online scheduling of outpatient procedure centers

DOI10.1287/IJOC.2017.0750MaRDI QIDQ5131692zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Bjorn P. Berg, Brian T. Denton

Publication date 9 November 2020

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.2017.0750

zbMATH Keywords

healthcare: outpatient procedure centersscheduling: approximationsstochastic programming

Mathematics Subject Classification ID

Approximation algorithms (68W25) Stochastic scheduling theory in operations research (90B36) Management decision making, including multiple objectives (90B50) Combinatorial optimization (90C27)

Recommendations

• Optimal booking and scheduling in outpatient procedure centers
• Online scheduling for outpatient services with heterogeneous patients and physicians
• Robust appointment scheduling
• Analysis of models for the stochastic outpatient procedure scheduling problem
• Dynamic advance scheduling of outpatient appointments in a moving booking window

Cites work

• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
• A 13/12 approximation algorithm for bin packing with extendable bins
• A class of simple stochastic online bin packing algorithms
• Analysis of Stochastic Online Bin Packing Processes
• Approximation algorithms for extensible bin packing
• Approximation algorithms for NP-hard problems.
• Approximation and Online Algorithms
• Bandwidth packing
• Bin packing can be solved within 1+epsilon in linear time
• Bin Packing with Queues
• Dynamic Bin Packing
• Fast algorithms for bin packing
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• Introduction to Stochastic Programming
• Lower bounds and reduction procedures for the bin packing problem
• New Algorithms for Bin Packing
• New classes of fast lower bounds for bin packing problems
• On the online bin packing problem
• On-line approximation algorithms for scheduling tasks on identical machines with extendable working time
• Optimal allocation of surgery blocks to operating rooms under uncertainty
• Robust surgery loading
• Scheduling space-sharing for internet advertising
• Stochastic integer programming: general models and algorithms
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse

Cited in

(16)

• Online scheduling for outpatient services with heterogeneous patients and physicians
• The price of fixed assignments in stochastic extensible bin packing
• Efficient optimization algorithms for surgical scheduling under uncertainty
• Appointment scheduling for medical diagnostic centers considering time-sensitive pharmaceuticals: a dynamic robust optimization approach
• Current trends in operating room scheduling 2015 to 2020: a literature review
• On-line booking policies and competitive analysis of medical examination in hospital
• Operating room planning and surgical case scheduling: a review of literature
• A study of decision support models for online patient-to-room assignment planning
• Optimal booking and scheduling in outpatient procedure centers
• Online capacity planning for rehabilitation treatments: an approximate dynamic programming approach
• Cutting and packing problems under uncertainty: literature review and classification framework
• Improved bounds for stochastic extensible bin packing under distributional assumptions
• Integration of text-mining and telemedicine appointment optimization
• Robust allocation of operating rooms: a cutting plane approach to handle lognormal case durations
• Generalized last open-end bin packing problem
• Approximation schemes for the generalized extensible bin packing problem

This page was built for publication: Fast approximation methods for online scheduling of outpatient procedure centers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5131692)