Finite buffer polling models with routing

DOI10.1016/j.ejor.2003.11.030zbMath1062.90016OpenAlexW2131080581WikidataQ57814300 ScholiaQ57814300MaRDI QIDQ1771367

Scott E. Grasman, John R. Birge, Tava Lennon Olsen

Publication date: 21 April 2005

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.11.030

zbMATH Keywords

RoutingQueueingPollingSetups

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items

Mathematical methods to study the polling systems, Queueing models of certain manufacturing cells under product-mix sequencing rules, A two-stage approach in solving the state probabilities of the multi-queueM/G/1 model

Uses Software

• PARDISO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A queueing network with a single cyclically roving server
• Determining Production Schedules Under Base-Stock Policies in Single Facility Multi-Item Production Systems
• A Practical Scheduling Method for Multiclass Production Systems with Setups
• Analysis of finite-capacity polling systems
• M/G/1/N Queue with Vacation Time and Exhaustive Service Discipline
• Queues Served in Cyclic Order
• Queues Served in Cyclic Order: Waiting Times