Pages that link to "Item:Q3452775"
From MaRDI portal
The following pages link to Towards Tight Lower Bounds for Scheduling Problems (Q3452775):
Displaying 14 items.
- Reducing the solution space of optimal task scheduling (Q336912) (← links)
- Scheduling and fixed-parameter tractability (Q896271) (← links)
- Tighter approximation bounds for LPT scheduling in two special cases (Q1026246) (← links)
- On Graham's bound for cyclic scheduling (Q1575599) (← links)
- Extending Graham's result on scheduling to other heuristics (Q1604040) (← links)
- Approximation Algorithms for Scheduling with Resource and Precedence Constraints (Q3304123) (← links)
- (Q3422387) (← links)
- Tighter Approximation Bounds for LPT Scheduling in Two Special Cases (Q3434556) (← links)
- (Q4866348) (← links)
- The Complexity of Scheduling for p-Norms of Flow and Stretch (Q4910823) (← links)
- An improved approximation algorithm for scheduling under arborescence precedence constraints (Q5089259) (← links)
- Non-Clairvoyant Precedence Constrained Scheduling. (Q5091220) (← links)
- Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (Q5117378) (← links)
- Tight performance bounds of CP-scheduling on out-trees (Q5952053) (← links)