Single machine scheduling with few deadlines (Q6926185)
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 8097203
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Single machine scheduling with few deadlines |
scientific article; zbMATH DE number 8097203 |
Statements
Single machine scheduling with few deadlines (English)
0 references
24 September 2025
0 references
single-machine scheduling
0 references
weighted completion time
0 references
tardy jobs
0 references
pseudopolynomial algorithms
0 references
parameterized complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
