When random-order-of-service outperforms first-come-first-served

DOI10.1016/J.ORL.2015.06.010zbMath1408.90092OpenAlexW878029117MaRDI QIDQ1785418

Koenraad Laevens, Wouter Rogiest, Joris Walraevens, Herwig Bruneel

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2015.06.010

zbMATH Keywords

scheduling policiesMarkov-modulated Poisson processfirst-come-first-servedrandom-order-of-service

Mathematics Subject Classification ID

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

Related Items (2)

Stationary Waiting Time Distribution in G|M|n|r with Random Renovation Policy ⋮ Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/\(1\) queue under random order service discipline

Cites Work

• Unnamed Item
• Unnamed Item
• On a processor sharing queue that models balking
• On the distribution of the number of customers in the symmetric M/G/1 queue
• The waiting time distribution for the random order service \(M/M/1\) queue
• The equivalence between processor sharing and service in random order.
• Machine Repair as a Priority Waiting-Line Problem
• The Queue M/G/1 with the Shortest Remaining Processing Time Discipline

This page was built for publication: When random-order-of-service outperforms first-come-first-served