Parallel machine scheduling with minimum number of tardy jobs: Approximation and exponential algorithms (Q115598101)
scientific article published in 2021
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel machine scheduling with minimum number of tardy jobs: Approximation and exponential algorithms |
scientific article published in 2021 |
Statements
Parallel machine scheduling with minimum number of tardy jobs: Approximation and exponential algorithms (English)
Federico Della Croce
Vincent T’kindt
Olivier Ploton
May 2021
397
125888
