A multi-echelon queueing model with dynamic priority scheduling

DOI10.1016/0377-2217(94)90206-2zbMath0803.90062OpenAlexW1997327199MaRDI QIDQ1330551

V. Pereyra

Publication date: 21 July 1994

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

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90206-2

zbMATH Keywords

schedulingsimulationstochastic processesMarkov processesmean waiting timemultiple serversmultiple finite source queueing modelnonpreemptive dynamic priority service discipline

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Steady-state approximations for multi-echelon multi-indentured repairable-item inventory system
• Multiple finite source queueing model with dynamic priority scheduling
• Mean-Value Analysis of Closed Multichain Queuing Networks
• A Model for a Multi-Item, Multi-Echelon, Multi-Indenture Inventory System
• Some approximations in multi-item, multi-echelon inventory systems for recoverable items
• The (S − 1, S) Inventory Policy Under Compound Poisson Demand