The largest-Z-ratio-first algorithm is 0.8531-approximate for scheduling unreliable jobs on \(m\) parallel machines
From MaRDI portal
Publication:2661490
DOI10.1016/j.orl.2020.05.006zbMath1478.90035arXiv1910.05702OpenAlexW3027962886MaRDI QIDQ2661490
Alessandro Agnetis, Thomas F. Lidbetter
Publication date: 7 April 2021
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.05702
Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (2)
Replication and sequencing of unreliable jobs on parallel machines ⋮ Time-critical testing and search problems
Cites Work
- An alternative proof of the Kawaguchi-Kyan bound for the largest-ratio-first rule
- Sequencing unreliable jobs on parallel machines
- ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
- Search and rescue in the face of uncertain threats
- The list scheduling algorithm for scheduling unreliable jobs on two parallel machines
- Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
This page was built for publication: The largest-Z-ratio-first algorithm is 0.8531-approximate for scheduling unreliable jobs on \(m\) parallel machines
