A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays (Q1306465): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 12:57, 31 January 2024
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