Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs (Q3826352)
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: Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs |
scientific article; zbMATH DE number 4100941
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs |
scientific article; zbMATH DE number 4100941 |
Statements
Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs (English)
0 references
1989
0 references
preemptive scheduling
0 references
parallel machines
0 references
NP-hard
0 references
fixed set of uniform machines
0 references
polynomial time
0 references
0.8941540718078613
0 references
0.8862754106521606
0 references
0.8813296556472778
0 references
0.8721039891242981
0 references
