scientific article; zbMATH DE number 221926
From MaRDI portal
Publication:4697329
DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199304)40:3<345::AID-NAV3220400305>3.0.CO;2-N" /><345::AID-NAV3220400305>3.0.CO;2-N 10.1002/1520-6750(199304)40:3<345::AID-NAV3220400305>3.0.CO;2-NzbMath0779.90032MaRDI QIDQ4697329
Publication date: 29 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22)
Related Items (21)
Scheduling arrivals to a queue ⋮ Optimal appointment scheduling in continuous time: the lag order approximation method ⋮ Scheduling arrivals to queues for minimum average blocking: The \(S(n)/M/C/C\) system ⋮ Optimally scheduling \(N\) customer arrival times for a single-server system ⋮ Appointment scheduling for multi-stage sequential service systems with limited distributional information ⋮ Appointment scheduling with a quantile objective ⋮ Dynamic appointment scheduling with wait-dependent abandonment ⋮ Next-day operating room scheduling with uncertain surgery durations: exact analysis and heuristics ⋮ Non-indexability of the stochastic appointment scheduling problem ⋮ The effect of few historical data on the performance of sample average approximation method for operating room scheduling ⋮ Optimal sequencing using a scheduling heuristic ⋮ Adaptive scheduling in service systems: a dynamic programming approach ⋮ Outpatient appointment systems in healthcare: a review of optimization studies ⋮ Coordinated Patient Appointment Scheduling for a Multistation Healthcare Network ⋮ Robust Appointment Scheduling with Heterogeneous Costs ⋮ Appointment sequencing: why the smallest-variance-first rule may not be optimal ⋮ Unnamed Item ⋮ A computational approach to optimized appointment scheduling ⋮ Dynamic multi-priority, multi-class patient scheduling with stochastic service times ⋮ Sequencing in an appointment system with deterministic arrivals and non-identical exponential service times ⋮ Sequencing and scheduling \(N\) customers for a stochastic server
Cites Work
This page was built for publication:
