A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach (Q3792237): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q101128280, #quickstatements; #temporary_batch_1705502051474 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q101128280 / rank | |||
Normal rank | |||
Revision as of 16:41, 17 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach |
scientific article |
Statements
A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach (English)
0 references
1988
0 references
scheduling
0 references
polynomial approximation scheme
0 references
minimum makespan problem
0 references
uniform parallel processors
0 references
