Repair systems with exchangeable items and the longest queue mechanism

DOI10.1007/s11134-012-9319-5zbMath1276.60103OpenAlexW2056610880MaRDI QIDQ1945442

David Perry, Rachel Ravid, Onno J. Boxma

Publication date: 8 April 2013

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-012-9319-5

zbMATH Keywords

sojourn timequeue lengthslongest queuerepair system

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items

A 3-queue polling system with join the shortest-serve the longest policy ⋮ Load balancing in a network of queueing-inventory systems ⋮ Stability of queueing-inventory systems with customers of different priorities ⋮ Waiting time distribution for an exchangeable item repair system with up to two failed components ⋮ A polling system with `join the shortest -- serve the longest' policy ⋮ A note on repair systems with exchangeable items and the longest queue mechanism

Cites Work

• A two-queue, one-server model with priority for the longer queue
• The symmetric longest queue system
• The Longer Queue Model
• Poisson Arrivals See Time Averages
• Calculation of Steady-State Probabilities for Repair Facilities with Multiple Sources and Dynamic Return Priorities
• A Queueing Model to Analyze the Value of Centralized Inventory Information
• Unnamed Item
• Unnamed Item