Finite buffer polling models with routing

DOI10.1016/J.EJOR.2003.11.030MaRDI QIDQ1771367zbMATH OpenOpenAlexDBLPWikidataFDO

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

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

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

Recommendations

• Finite-buffer polling systems with threshold-based switching policy
• scientific article; zbMATH DE number 4025135
• A State-Dependent Polling Model with Markovian Routing
• Polling systems with periodic server routing in heavy traffic
• scientific article; zbMATH DE number 2079411
• Modeling bufferless packet-switching networks with packet dependencies
• Optimal routing and buffer allocation for a class of finite capacity queueing systems
• Routing and buffer allocation models for a telecommunication system with heterogeneous devices

Cites work

• scientific article; zbMATH DE number 994725 (Why is no real title available?)
• scientific article; zbMATH DE number 1093829 (Why is no real title available?)
• scientific article; zbMATH DE number 2087097 (Why is no real title available?)
• M/G/1/N Queue with Vacation Time and Exhaustive Service Discipline
• A practical scheduling method for multiclass production systems with setups
• A queueing network with a single cyclically roving server
• Analysis of finite-capacity polling systems
• Determining production schedules under base-stock policies in single facility multi-item production systems
• Queues Served in Cyclic Order
• Queues Served in Cyclic Order: Waiting Times

Cited in

(5)

• Mathematical methods to study the polling systems
• A two-stage approach in solving the state probabilities of the multi-queue \(M/G/1\) model
• Analysis of tandem polling queues with finite buffers
• Queueing models of certain manufacturing cells under product-mix sequencing rules
• Finite-buffer polling systems with threshold-based switching policy

Describes a project that uses

Uses Software

• PARDISO

This page was built for publication: Finite buffer polling models with routing

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