Sequencing and scheduling \(N\) customers for a stochastic server

DOI10.1016/S0377-2217(98)00340-3zbMath0945.90015MaRDI QIDQ1809854

Pu Patrick Wang

Publication date: 11 October 2000

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

zbMATH Keywords

queueingMarkov chainsscheduling theory

Mathematics Subject Classification ID

Markov processes: estimation; hidden Markov models (62M05) Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40)

Related Items (13)

Optimized appointment scheduling ⋮ Optimal appointment scheduling in continuous time: the lag order approximation method ⋮ Appointment-driven queueing systems with non-punctual customers ⋮ 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 ⋮ Dynamic scheduling with uncertain job types ⋮ Robust Appointment Scheduling with Heterogeneous Costs ⋮ Appointment sequencing: why the smallest-variance-first rule may not be optimal ⋮ Home service routing and appointment scheduling with stochastic service times ⋮ Sequencing in an appointment system with deterministic arrivals and non-identical exponential service times

Cites Work

• Optimally scheduling \(N\) customer arrival times for a single-server system
• Transient analysis of acyclic markov chains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sequencing and scheduling \(N\) customers for a stochastic server