The Largest-Z-ratio-First algorithm is 0.8531-approximate for scheduling unreliable jobs on m parallel machines
Year of publication: |
2020
|
---|---|
Authors: | Agnetis, Alessandro ; Lidbetter, Thomas |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 48.2020, 4, p. 405-409
|
Subject: | Approximation ratio | Largest-ratio-first | Unreliable jobs | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Produktionssteuerung | Production control |
-
Replication and sequencing of unreliable jobs on parallel machines
Agnetis, Alessandro, (2022)
-
Biogeography-based optimisation for flexible manufacturing system scheduling problem
Shahla Paslar, (2015)
-
Improved algorithms for machine allocation in manufacturing problems
Frenk, Johannes G., (1991)
- More ...
-
Mining coal or finding terrorists : the expanding search paradigm
Alpern, Steve, (2012)
-
Optimal trade-off between speed and acuity when searching for a small object
Alpern, Steve, (2015)
-
Searching a variable speed network
Alpern, Steve, (2014)
- More ...