When random-order-of-service outperforms first-come-first-served
type: Item
instance of: scholarly article
title: When random-order-of-service outperforms first-come-first-served
zbMATH Open document ID: 1408.90092
published in: Operations Research Letters
publication date: 2018-09-28T00:00:00Z
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60K25
zbMATH DE Number: 6945399
zbMATH Keywords: scheduling policies
zbMATH Keywords: Markov-modulated Poisson process
zbMATH Keywords: first-come-first-served
zbMATH Keywords: random-order-of-service
author: Wouter Rogiest
author: Koenraad Laevens
author: Joris Walraevens
author: Herwig Bruneel
MaRDI profile type: Publication
full work available at URL: j.orl.2015.06.010
OpenAlex ID: W878029117
cites work: The equivalence between processor sharing and service in random order.
cites work: On the distribution of the number of customers in the symmetric M/G/1 queue
cites work: The waiting time distribution for the random order service \(M/M/1\) queue
cites work: Q3855869
cites work: Q4134686
cites work: On a processor sharing queue that models balking
cites work: Machine Repair as a Priority Waiting-Line Problem
cites work: The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
DOI: 10.1016/J.ORL.2015.06.010
description: scientific article; zbMATH DE number 6945399