A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays (Q1306465)
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 fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays |
scientific article; zbMATH DE number 1347293
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays |
scientific article; zbMATH DE number 1347293 |
Statements
A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays (English)
0 references
3 September 2001
0 references
minimum delays
0 references
single-machine scheduling
0 references
precedence delays
0 references
pseudo-polynomial algorithm
0 references
polynomial approximation
0 references
0.89980125
0 references
0.89525723
0 references
0.88618404
0 references
0.8848858
0 references
0.8821475
0 references
0.8819133
0 references
0.8793691
0 references
