A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint (Q5059405)
From MaRDI portal
scientific article; zbMATH DE number 7637166
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint |
scientific article; zbMATH DE number 7637166 |
Statements
A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint (English)
0 references
23 December 2022
0 references
scheduling
0 references
machine availability
0 references
learning effect
0 references
total completion time
0 references
0 references
0 references
0 references
0 references
0 references
