A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays (Q1306465)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays |
scientific article |
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
