The following pages link to (Q4866348):
Displaying 10 items.
- Approximate solution of a resource-constrained scheduling problem (Q1009198) (← links)
- Tighter approximation bounds for LPT scheduling in two special cases (Q1026246) (← links)
- On Graham's bound for cyclic scheduling (Q1575599) (← links)
- Approximation of the supply scheduling problem (Q1779701) (← links)
- (Q3033547) (← links)
- Bounds for naive multiple machine scheduling with release times and deadlines (Q3319773) (← links)
- (Q3422387) (← links)
- Tighter Approximation Bounds for LPT Scheduling in Two Special Cases (Q3434556) (← links)
- Approximately Supermodular Scheduling Subject to Matroid Constraints (Q5090799) (← links)
- (Q5874275) (← links)