Approximability of single machine scheduling with fixed jobs to minimize total completion time (Q857360)
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: Approximability of single machine scheduling with fixed jobs to minimize total completion time |
scientific article; zbMATH DE number 5080340
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximability of single machine scheduling with fixed jobs to minimize total completion time |
scientific article; zbMATH DE number 5080340 |
Statements
Approximability of single machine scheduling with fixed jobs to minimize total completion time (English)
0 references
14 December 2006
0 references
scheduling
0 references
single machine
0 references
fixed jobs
0 references
precedence constraints
0 references
0 references
0.8807779550552368
0 references
0.8530001640319824
0 references
0.8529998660087585
0 references
