Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms (Q2242051)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms |
scientific article |
Statements
Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms (English)
0 references
9 November 2021
0 references
number of tardy jobs
0 references
identical parallel machines scheduling
0 references
exponential time approximation
0 references
0 references
0 references
0 references
