Limit theorems for polling models with increasing setups.

DOI10.1017/S026996480115103XMaRDI QIDQ2713002zbMATH OpenOpenAlexWikidataFDO

Authors Tava Lennon Olsen

Publication date 2001

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s026996480115103x

Mathematics Subject Classification ID

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

Recommendations

• On polling systems with large setups
• Polling systems with state-dependent setup times
• Approximations for the waiting time distribution in polling models with and without state-dependent setups
• Multiclass production systems with setup times
• Branching-type polling systems with large setups

Cited in

(14)

• Asymptotic optimality of the binomial-exhaustive policy for polling systems with large switchover times
• Mathematical methods to study the polling systems
• On polling systems with large setups
• Multiclass production systems with setup times
• When does forced idle time improve performance in polling models?
• Polling Models Under Limited Service Policies: Sharp Asymptotics
• POLLING SYSTEMS WITH TWO-PHASE GATED SERVICE
• On open problems in polling systems
• The Impact of Setup Times on the Performance of Multiclass Service and Production Systems
• Polling systems with periodic server routeing in heavy traffic: distribution of the delay
• Setups in polling models: does it make sense to set up if no work is waiting?
• Approximations for the waiting time distribution in polling models with and without state-dependent setups
• Asymptotics in the Thurstone model with an increasing items
• Branching-type polling systems with large setups

This page was built for publication: Limit theorems for polling models with increasing setups.

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