Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (Q4578168)
From MaRDI portal
scientific article; zbMATH DE number 6914630
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines |
scientific article; zbMATH DE number 6914630 |
Statements
Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (English)
0 references
8 August 2018
0 references
scheduling
0 references
parallel machine
0 references
approximation
0 references
0 references
0 references
