A polynomial time approximation scheme for general multiprocessor job scheduling (Q2719127)
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: A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling |
scientific article; zbMATH DE number 1608790
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time approximation scheme for general multiprocessor job scheduling |
scientific article; zbMATH DE number 1608790 |
Statements
21 June 2001
0 references
job scheduling
0 references
approximation algorithm
0 references
polynomial time approximation scheme
0 references
multiprocessor processing
0 references
0.9899115
0 references
0.97074693
0 references
0.9291468
0 references
0.9203615
0 references
0.9202863
0 references
0.9184185
0 references
A polynomial time approximation scheme for general multiprocessor job scheduling (English)
0 references
