The list scheduling algorithm for scheduling unreliable jobs on two parallel machines

DOI10.1016/j.dam.2012.09.014zbMath1311.90043OpenAlexW2091687666MaRDI QIDQ2448904

Paolo Detti, Alessandro Agnetis, Marco Pranzo

Publication date: 5 May 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.09.014

zbMATH Keywords

list schedulingapproximation algorithmsunreliable jobs

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Scheduling nonpreemptive jobs on parallel machines subject to exponential unrecoverable interruptions ⋮ The largest-Z-ratio-first algorithm is 0.8531-approximate for scheduling unreliable jobs on \(m\) parallel machines ⋮ Replication and sequencing of unreliable jobs on parallel machines ⋮ Time-critical testing and search problems

Cites Work

• Unnamed Item
• Sequencing unreliable jobs on parallel machines
• ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
• Sequential testing of complex systems: a review
• Optimal testing and repairing a failed series system
• Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem

This page was built for publication: The list scheduling algorithm for scheduling unreliable jobs on two parallel machines