A new approximation algorithm for UET-scheduling with chain-type precedence constraints. (Q1406686)
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 new approximation algorithm for UET-scheduling with chain-type precedence constraints. |
scientific article; zbMATH DE number 1975798
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new approximation algorithm for UET-scheduling with chain-type precedence constraints. |
scientific article; zbMATH DE number 1975798 |
Statements
A new approximation algorithm for UET-scheduling with chain-type precedence constraints. (English)
0 references
7 September 2003
0 references
Precedence constraints
0 references
parallel machines
0 references
makespan
0 references
approximation algorithm
0 references
0 references
