The largest-Z-ratio-first algorithm is 0.8531-approximate for scheduling unreliable jobs on \(m\) parallel machines (Q2661490): Difference between revisions

@@ Property / DOI @@
-.1016/j.orl.2020.05.006
@@ Property / DOI: 10.1016/j.orl.2020.05.006 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3027962886
@@ Property / OpenAlex ID: W3027962886 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.05702
@@ Property / arXiv ID: 1910.05702 / rank @@
+Normal rank
@@ Property / cites work @@
+The list scheduling algorithm for scheduling unreliable jobs on two parallel machines
+Normal rank
@@ Property / cites work @@
+Sequencing unreliable jobs on parallel machines
@@ Property / cites work: Sequencing unreliable jobs on parallel machines / rank @@
+Normal rank
@@ Property / cites work @@
+Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
+Normal rank
@@ Property / cites work @@
+Search and rescue in the face of uncertain threats
+Normal rank
@@ Property / cites work @@
+``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation
+Normal rank
@@ Property / cites work @@
+An alternative proof of the Kawaguchi-Kyan bound for the largest-ratio-first rule
+Normal rank
@@ Property / DOI @@
+.1016/J.ORL.2020.05.006
@@ Property / DOI: 10.1016/J.ORL.2020.05.006 / rank @@
+Normal rank