Complexity of scheduling few types of jobs on related and unrelated machines (Q6985600)
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 8038424
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of scheduling few types of jobs on related and unrelated machines |
scientific article; zbMATH DE number 8038424 |
Statements
Complexity of scheduling few types of jobs on related and unrelated machines (English)
0 references
12 May 2025
0 references
high-multiplicity jobs
0 references
cutting stock
0 references
hardness
0 references
parameterized complexity
0 references
0 references
