Pages that link to "Item:Q5890508"
From MaRDI portal
The following pages link to Bounding the Running Time of Algorithms for Scheduling and Packing Problems (Q5890508):
Displaying 5 items.
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- On the fine-grained parameterized complexity of partial scheduling to minimize the makespan (Q2161009) (← links)
- Non-preemptive scheduling in a smart grid model and its implications on machine minimization (Q2211351) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- (Q6068263) (← links)
