Optimal Preemptive Scheduling of Two Unrelated Processors (Q4025916)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal Preemptive Scheduling of Two Unrelated Processors |
scientific article; zbMATH DE number 124265
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal Preemptive Scheduling of Two Unrelated Processors |
scientific article; zbMATH DE number 124265 |
Statements
Optimal Preemptive Scheduling of Two Unrelated Processors (English)
0 references
18 February 1993
0 references
makespan-optimal preemptive schedules
0 references
independent jobs
0 references
unrelated parallel processors
0 references
linear time algorithm
0 references
0.8926350474357605
0 references
0.8614687323570251
0 references
0.8575506210327148
0 references
0.8433012962341309
0 references
0.8429887294769287
0 references
