On the fine-grained parameterized complexity of partial scheduling to minimize the makespan (Q2161009)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the fine-grained parameterized complexity of partial scheduling to minimize the makespan |
scientific article |
Statements
On the fine-grained parameterized complexity of partial scheduling to minimize the makespan (English)
0 references
3 August 2022
0 references
fixed-parameter tractability
0 references
scheduling
0 references
precedence constraints
0 references
0 references
0 references