Minimizing the weighted number of tardy jobs is W[1]-hard (Q7253132)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8203279
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the weighted number of tardy jobs is W[1]-hard |
scientific article; zbMATH DE number 8203279 |
Statements
Minimizing the weighted number of tardy jobs is W[1]-hard (English)
0 references
26 May 2026
0 references
single-machine scheduling
0 references
number of different weights
0 references
number of different processing times
0 references
0 references
0 references
0 references
0 references
