Optimal stationary appointment schedules

DOI10.1016/j.orl.2017.08.002zbMath1409.90088OpenAlexW2753562714MaRDI QIDQ1728352

Jeroen de Mast, Alex Kuiper, M. R. H. Mandjes

Publication date: 22 February 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2017.08.002

zbMATH Keywords

queueingheavy trafficphase-type distributionsappointment scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (4)

Appointment-driven queueing systems with non-punctual customers ⋮ Non-indexability of the stochastic appointment scheduling problem ⋮ Adaptive scheduling in service systems: a dynamic programming approach ⋮ Asymptotically Optimal Appointment Schedules

Cites Work

• Optimized appointment scheduling
• Optimally scheduling \(N\) customer arrival times for a single-server system
• On the Lambert \(w\) function
• A computational approach to optimized appointment scheduling
• Fractional Brownian Motion withH< 1/2 as a Limit of Scheduled Traffic
• Applied Probability and Queues
• Some inequalities for the queue GI/G/1
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal stationary appointment schedules