A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays (Q1306465): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0167-6377(98)00012-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2150736907 / rank | |||
Normal rank | |||
Latest revision as of 10:10, 30 July 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
