When random-order-of-service outperforms first-come-first-served (Q1785418): Difference between revisions

@@ Property / DOI @@
-.1016/j.orl.2015.06.010
@@ Property / DOI: 10.1016/j.orl.2015.06.010 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2015.06.010
+Normal rank
@@ Property / OpenAlex ID @@
+W878029117
@@ Property / OpenAlex ID: W878029117 / rank @@
+Normal rank
@@ Property / cites work @@
+The equivalence between processor sharing and service in random order.
+Normal rank
@@ Property / cites work @@
+On the distribution of the number of customers in the symmetric M/G/1 queue
+Normal rank
@@ Property / cites work @@
+The waiting time distribution for the random order service \(M/M/1\) queue
+Normal rank
@@ Property / cites work @@
+Q3855869
@@ Property / cites work: Q3855869 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4134686
@@ Property / cites work: Q4134686 / rank @@
+Normal rank
@@ Property / cites work @@
+On a processor sharing queue that models balking
@@ Property / cites work: On a processor sharing queue that models balking / rank @@
+Normal rank
@@ Property / cites work @@
+Machine Repair as a Priority Waiting-Line Problem
@@ Property / cites work: Machine Repair as a Priority Waiting-Line Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Queue <i>M</i>/<i>G</i>/1 with the Shortest Remaining Processing Time Discipline
+Normal rank
@@ Property / DOI @@
+.1016/J.ORL.2015.06.010
@@ Property / DOI: 10.1016/J.ORL.2015.06.010 / rank @@
+Normal rank