Fast approximation methods for online scheduling of outpatient procedure centers
DOI10.1287/IJOC.2017.0750zbMATH Open1446.90089DBLPjournals/informs/BergD17OpenAlexW2743120001WikidataQ59193443 ScholiaQ59193443MaRDI QIDQ5131692FDOQ5131692
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
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
Management decision making, including multiple objectives (90B50) Combinatorial optimization (90C27) Approximation algorithms (68W25) Stochastic scheduling theory in operations research (90B36)
Cites Work
- Approximation algorithms for NP-hard problems.
- Title not available (Why is that?)
- Bin packing can be solved within 1+epsilon in linear time
- On the online bin packing problem
- Introduction to Stochastic Programming
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Fast algorithms for bin packing
- Dynamic Bin Packing
- New Algorithms for Bin Packing
- Stochastic integer programming: general models and algorithms
- Optimal allocation of surgery blocks to operating rooms under uncertainty
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- On-line approximation algorithms for scheduling tasks on identical machines with extendable working time
- A 13/12 approximation algorithm for bin packing with extendable bins
- New classes of fast lower bounds for bin packing problems
- Robust surgery loading
- Lower bounds and reduction procedures for the bin packing problem
- Bin Packing with Queues
- A class of simple stochastic online bin packing algorithms
- Scheduling space-sharing for internet advertising
- Approximation algorithms for extensible bin packing
- Approximation and Online Algorithms
- Bandwidth packing
- Analysis of Stochastic Online Bin Packing Processes
Cited In (15)
- Approximation schemes for the generalized extensible bin packing problem
- On-line booking policies and competitive analysis of medical examination in hospital
- A study of decision support models for online patient-to-room assignment planning
- Appointment scheduling for medical diagnostic centers considering time-sensitive pharmaceuticals: a dynamic robust optimization approach
- The price of fixed assignments in stochastic extensible bin packing
- Online capacity planning for rehabilitation treatments: an approximate dynamic programming approach
- Robust allocation of operating rooms: a cutting plane approach to handle lognormal case durations
- Improved bounds for stochastic extensible bin packing under distributional assumptions
- Optimal booking and scheduling in outpatient procedure centers
- Efficient optimization algorithms for surgical scheduling under uncertainty
- Integration of text-mining and telemedicine appointment optimization
- Online scheduling for outpatient services with heterogeneous patients and physicians
- Cutting and packing problems under uncertainty: literature review and classification framework
- Current trends in operating room scheduling 2015 to 2020: a literature review
- Operating room planning and surgical case scheduling: a review of literature
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)
