Pages that link to "Item:Q1785250"
From MaRDI portal
The following pages link to An improved lower bound for rank four scheduling (Q1785250):
Displaying 5 items.
- On the weak computability of a four dimensional orthogonal packing and time scheduling problem (Q391303) (← links)
- On the optimality of exact and approximation algorithms for scheduling problems (Q1635503) (← links)
- Parameterized and approximation results for scheduling with a low rank processing time matrix (Q4636620) (← links)
- A PTAS for Scheduling Unrelated Machines of Few Different Types (Q5895057) (← links)
- An EPTAS for scheduling on unrelated machines of few different types (Q5919620) (← links)