On the complexity of scheduling problems with a fixed number of parallel identical machines (Q6169524)
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 7726604
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of scheduling problems with a fixed number of parallel identical machines |
scientific article; zbMATH DE number 7726604 |
Statements
On the complexity of scheduling problems with a fixed number of parallel identical machines (English)
0 references
14 August 2023
0 references
SETH
0 references
subset sum
0 references
scheduling
0 references
fine-grained complexity
0 references
pseudo-polynomial algorithms
0 references
0 references
0 references
0.826418936252594
0 references
0.8263465166091919
0 references
0.7996717095375061
0 references
0.7968237996101379
0 references
0.79571932554245
0 references
