Parameterized complexity of machine scheduling: 15 open problems (Q1782183)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parameterized complexity of machine scheduling: 15 open problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of machine scheduling: 15 open problems |
scientific article |
Statements
Parameterized complexity of machine scheduling: 15 open problems (English)
0 references
18 September 2018
0 references
parallel machines
0 references
shop scheduling
0 references
makespan
0 references
total completion time
0 references
total tardiness
0 references
throughput
0 references
number of tardy jobs
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8050012588500977
0 references
0.8012339472770691
0 references
0.7983068823814392
0 references
