Pages that link to "Item:Q439484"
From MaRDI portal
The following pages link to Approximate dynamic programming for capacity allocation in the service industry (Q439484):
Displaying 26 items.
- Computationally efficient evaluation of appointment schedules in health care (Q296642) (← links)
- Scheduling the hospital-wide flow of elective patients (Q297017) (← links)
- Capacity allocation for demand of different customer-product-combinations with cancellations, no-shows, and overbooking when there is a sequential delivery of service (Q363587) (← links)
- The single-day surgery scheduling problem: sequential decision-making and threshold-based heuristics (Q427505) (← links)
- Optimization and approximation methods for dynamic appointment scheduling with patient choices (Q1651585) (← links)
- Least squares approximate policy iteration for learning bid prices in choice-based revenue management (Q1652041) (← links)
- Outpatient appointment systems in healthcare: a review of optimization studies (Q1698879) (← links)
- Capacity allocation under downstream competition and bargaining (Q1753560) (← links)
- Dual bounds of a service level assignment problem with applications to efficient pricing (Q1754037) (← links)
- A hyper-heuristic selector algorithm for cloud computing scheduling based on workflow features (Q2150469) (← links)
- Integrating nurse assignment in outpatient chemotherapy appointment scheduling (Q2215557) (← links)
- Dynamic multi-appointment patient scheduling for radiation therapy (Q2253376) (← links)
- Dynamic multi-priority, multi-class patient scheduling with stochastic service times (Q2272318) (← links)
- Implementation strategies of a contract-based MRI examination reservation process for stroke patients (Q2356103) (← links)
- Operating room planning and surgical case scheduling: a review of literature (Q2424648) (← links)
- Outpatient appointment scheduling given individual day-dependent no-show predictions (Q2629628) (← links)
- Optimal insertion of customers with waiting time targets (Q2664326) (← links)
- An approximate dynamic programming approach to the admission control of elective patients (Q2668708) (← links)
- Appointment scheduling with a quantile objective (Q2668736) (← links)
- Simulation-Based Approximate Policy Iteration with Generalized Logistic Functions (Q3458754) (← links)
- (Q3826339) (← links)
- ONLINE CAPACITY PLANNING FOR REHABILITATION TREATMENTS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH (Q5070863) (← links)
- Optimal service‐capacity allocation in a loss system (Q5249461) (← links)
- (Q5257305) (← links)
- Return and refund policy for product and core service bundling in the dual‐channel supply chain (Q6066296) (← links)
- A simulation-based approximate dynamic programming approach to dynamic and stochastic resource-constrained multi-project scheduling problem (Q6554641) (← links)
