ScholarGate
Ассистент

Сравнение методов

Просматривайте выбранные методы рядом; строки с различиями подсвечены.

Робастное моделирование очередей×Имитационное моделирование систем массового обслуживания×
ОбластьИмитационное моделированиеИмитационное моделирование
СемействоProcess / pipelineProcess / pipeline
Год появления2000s–20181909
Автор методаWhitt, W. and colleagues; Bertsimas, D. and colleaguesAgner Krarup Erlang
ТипSimulation with worst-case uncertainty propagationStochastic simulation / analytical modeling
Основополагающий источникBertsimas, D., Natarajan, K., & Teo, C.-P. (2011). Distributionally robust optimization: A review. European Journal of Operational Research. link ↗Kleinrock, L. (1975). Queueing Systems, Volume 1: Theory. Wiley-Interscience, New York. ISBN: 978-0471491101
Другие названияRQS, Distributionally Robust Queueing, Robust Queue Simulation, Uncertainty-Aware Queueing SimulationQueue Simulation, Queuing Theory Simulation, Waiting-Line Simulation, DES-Queue
Связанные66
СводкаRobust Queueing Simulation integrates robustness analysis into queueing system simulation by considering worst-case or uncertainty-set-driven scenarios for arrival rates, service distributions, and queue disciplines. It produces performance guarantees that hold across an entire family of plausible input distributions, making it essential for risk-sensitive service system design.Queueing Simulation combines classical queueing theory with discrete-event simulation to model systems where entities arrive, wait for service, and depart. It predicts performance metrics such as average waiting time, queue length, and server utilization, enabling capacity planning and bottleneck identification across service, manufacturing, healthcare, and network systems.
ScholarGateНабор данных
  1. v1
  2. 2 Источники
  3. PUBLISHED
  1. v1
  2. 2 Источники
  3. PUBLISHED

Перейти к поиску Download slides

ScholarGateСравнение методов: Robust Queueing Simulation · Queueing Simulation. Получено 2026-06-15 из https://scholargate.app/ru/compare