The largest-Z-ratio-first algorithm is 0.8531-approximate for scheduling unreliable jobs on \(m\) parallel machines (Q2661490): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.orl.2020.05.006 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ORL.2020.05.006 / rank | |||
Normal rank | |||
Latest revision as of 14:07, 19 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The largest-Z-ratio-first algorithm is 0.8531-approximate for scheduling unreliable jobs on \(m\) parallel machines |
scientific article |
Statements
The largest-Z-ratio-first algorithm is 0.8531-approximate for scheduling unreliable jobs on \(m\) parallel machines (English)
0 references
7 April 2021
0 references
unreliable jobs
0 references
largest-ratio-first
0 references
approximation ratio
0 references
