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
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The list scheduling algorithm for scheduling unreliable jobs on two parallel machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sequencing unreliable jobs on parallel machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Search and rescue in the face of uncertain threats / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: ``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An alternative proof of the Kawaguchi-Kyan bound for the largest-ratio-first rule / rank | |||
Normal rank | |||
Revision as of 22:06, 24 July 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
