Pages that link to "Item:Q2448904"
From MaRDI portal
The following pages link to The list scheduling algorithm for scheduling unreliable jobs on two parallel machines (Q2448904):
Displaying 4 items.
- Scheduling nonpreemptive jobs on parallel machines subject to exponential unrecoverable interruptions (Q1652152) (← links)
- Time-critical testing and search problems (Q2242292) (← links)
- The largest-Z-ratio-first algorithm is 0.8531-approximate for scheduling unreliable jobs on \(m\) parallel machines (Q2661490) (← links)
- Replication and sequencing of unreliable jobs on parallel machines (Q2669802) (← links)
