Polynomial-time approximation schemes for scheduling problems with time lags (Q600835)
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: Polynomial-time approximation schemes for scheduling problems with time lags |
scientific article; zbMATH DE number 5809606
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial-time approximation schemes for scheduling problems with time lags |
scientific article; zbMATH DE number 5809606 |
Statements
Polynomial-time approximation schemes for scheduling problems with time lags (English)
0 references
3 November 2010
0 references
machine scheduling
0 references
time lags
0 references
approximability
0 references
polynomial-time approximation scheme (PTAS)
0 references
0 references
0 references
0 references
0.8163159489631653
0 references
0.8060160279273987
0 references
0.8046384453773499
0 references
0.7886348366737366
0 references
