Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems (Q6130890)
From MaRDI portal
scientific article; zbMATH DE number 7827250
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems |
scientific article; zbMATH DE number 7827250 |
Statements
Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems (English)
0 references
3 April 2024
0 references
scheduling
0 references
metric approach
0 references
approximation
0 references
0 references
0 references
0 references
0 references
0 references
