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 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: One-machine generalized precedence constrained scheduling problems / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:30, 29 May 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
