A short note on the approximation of the single machine scheduling problem to minimize makespan with fixed jobs and precedence constraints (Q3402964)
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 short note on the approximation of the single machine scheduling problem to minimize makespan with fixed jobs and precedence constraints |
scientific article; zbMATH DE number 5669974
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A short note on the approximation of the single machine scheduling problem to minimize makespan with fixed jobs and precedence constraints |
scientific article; zbMATH DE number 5669974 |
Statements
12 February 2010
0 references
scheduling
0 references
single machine
0 references
fixed-jobs
0 references
precedence constraints
0 references
0.8807779550552368
0 references
0.8244039416313171
0 references
0.8194241523742676
0 references
0.8194241523742676
0 references
0.8039032816886902
0 references
