Approximation Algorithms for Fixed Job Schedule Problems (Q3990569)
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: Approximation Algorithms for Fixed Job Schedule Problems |
scientific article; zbMATH DE number 38298
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation Algorithms for Fixed Job Schedule Problems |
scientific article; zbMATH DE number 38298 |
Statements
Approximation Algorithms for Fixed Job Schedule Problems (English)
0 references
28 June 1992
0 references
fixed job schedule problem
0 references
polynomial-time approximation algorithms
0 references
preemptive relaxation
0 references
greedy solution
0 references
