Choosing a Good Appointment System—A Study of Queues of the Type (D, M, 1)

DOI10.1287/OPRE.14.2.292zbMATH Open0154.43403OpenAlexW2085688626WikidataQ56907711 ScholiaQ56907711MaRDI QIDQ5535477FDOQ5535477

Birger Jansson

Publication date: 1966

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

Full work available at URL: https://doi.org/10.1287/opre.14.2.292

zbMATH Keywords

probability theory

Cited In (16)

• Queueing theory
• Analysis of models for the stochastic outpatient procedure scheduling problem
• An appointment-based service center with guaranteed service
• A tandem queueing model for an appointment-based service system
• Scheduling arrivals to queues for minimum average blocking: The \(S(n)/M/C/C\) system
• Title not available (Why is that?)
• Finite capacity priority queues with potential health applications
• A numerical procedure for the selection of the constant interarrival time to a single server queue
• Allocation of flows in closed bipartite queueing networks
• Scheduling arrivals to a queue
• Appointment-driven queueing systems with non-punctual customers
• Optimally scheduling \(N\) customer arrival times for a single-server system
• Evaluating the impact of operating conditions on the performance of appointment scheduling rules in service systems
• ?/M/1: On the equilibrium distribution of customer arrivals
• Matching daily healthcare provider capacity to demand in advanced access scheduling systems
• Sequencing in an appointment system with deterministic arrivals and non-identical exponential service times

This page was built for publication: Choosing a Good Appointment System—A Study of Queues of the Type (D, M, 1)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5535477)