Parameterized complexity of machine scheduling: 15 open problems (Q1782183): Difference between revisions
From MaRDI portal
Latest revision as of 23:01, 5 November 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
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