Approximate dynamic programming for capacity allocation in the service industry

DOI10.1016/J.EJOR.2011.09.007zbMATH Open1244.90238OpenAlexW3020899234MaRDI QIDQ439484FDOQ439484

Hans-Jörg Schütz, Rainer Kolisch

Publication date: 16 August 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.09.007

Recommendations

• Capacity allocation for demand of different customer-product-combinations with cancellations, no-shows, and overbooking when there is a sequential delivery of service
• ONLINE CAPACITY PLANNING FOR REHABILITATION TREATMENTS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH
• Advance patient appointment scheduling
• Simulation-based approximate policy iteration with generalized logistic functions
• An approximate dynamic programming approach to the admission control of elective patients

zbMATH Keywords

semi-Markov decision processapproximate dynamic programmingreinforcement learningcapacity allocationserviceshealth care operations

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reinforcement learning for long-run average cost.
• A policy gradient method for semi-Markov decision processes with application to call admission control
• Solving Semi-Markov Decision Problems Using Average Reward Reinforcement Learning
• The Linear Programming Approach to Approximate Dynamic Programming
• Approximate Dynamic Programming
• The theory and practice of revenue management
• Providing radiology health care services to stochastic demand of different customer classes
• Managing Patient Service in a Diagnostic Medical Facility
• Revenue Management for a Primary-Care Clinic in the Presence of Patient Choice
• Dynamic Multipriority Patient Scheduling for a Diagnostic Resource
• Title not available (Why is that?)
• A Price-Directed Approach to Stochastic Inventory/Routing
• On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
• Airline yield management with overbooking, cancellations, and no-shows
• Reservation Planning for Elective Surgery Under Uncertain Demand for Emergency Surgery
• Optimal grouping for a nuclear magnetic resonance scanner by means of an open queueing model.
• Simulation-based optimization: Parametric optimization techniques and reinforcement learning
• Clinic scheduling models with overbooking for patients with heterogeneous no-show probabilities
• Dynamic Bid Prices in Revenue Management
• Optimization models for radiotherapy patient scheduling
• A Cost-Shaping Linear Program for Average-Cost Approximate Dynamic Programming with Performance Guarantees

Cited In (24)

• A simulation-based approximate dynamic programming approach to dynamic and stochastic resource-constrained multi-project scheduling problem
• Dynamic multi-priority, multi-class patient scheduling with stochastic service times
• Return and refund policy for product and core service bundling in the dual‐channel supply chain
• Outpatient appointment scheduling given individual day-dependent no-show predictions
• Optimal service‐capacity allocation in a loss system
• Appointment scheduling with a quantile objective
• Computationally efficient evaluation of appointment schedules in health care
• Scheduling the hospital-wide flow of elective patients
• Implementation strategies of a contract-based MRI examination reservation process for stroke patients
• Title not available (Why is that?)
• Optimization and approximation methods for dynamic appointment scheduling with patient choices
• A hyper-heuristic selector algorithm for cloud computing scheduling based on workflow features
• Dual bounds of a service level assignment problem with applications to efficient pricing
• Least squares approximate policy iteration for learning bid prices in choice-based revenue management
• Capacity allocation under downstream competition and bargaining
• Optimal insertion of customers with waiting time targets
• The single-day surgery scheduling problem: sequential decision-making and threshold-based heuristics
• Capacity allocation for demand of different customer-product-combinations with cancellations, no-shows, and overbooking when there is a sequential delivery of service
• Dynamic multi-appointment patient scheduling for radiation therapy
• Title not available (Why is that?)
• ONLINE CAPACITY PLANNING FOR REHABILITATION TREATMENTS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH
• Outpatient appointment systems in healthcare: a review of optimization studies
• Operating room planning and surgical case scheduling: a review of literature
• Integrating nurse assignment in outpatient chemotherapy appointment scheduling

This page was built for publication: Approximate dynamic programming for capacity allocation in the service industry

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