Approximate dynamic programming for capacity allocation in the service industry

DOI10.1016/j.ejor.2011.09.007zbMath1244.90238MaRDI QIDQ439484

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

zbMATH Keywords

reinforcement learning; semi-Markov decision process; services; approximate dynamic programming; capacity allocation; health care operations

Mathematics Subject Classification ID

90B22: Queues and service in operations research

90C39: Dynamic programming

90C40: Markov and semi-Markov decision processes

Related Items

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

Cites Work

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