Pages that link to "Item:Q2875202"
From MaRDI portal
The following pages link to Conditional hardness of precedence constrained scheduling on identical machines (Q2875202):
Displaying 8 items.
- A note on the precedence-constrained class sequencing problem (Q868379) (← links)
- Makespan minimization with OR-precedence constraints (Q2059086) (← links)
- Approximation Algorithms for Scheduling with Resource and Precedence Constraints (Q3304123) (← links)
- Bi-Covering: Covering Edges with Two Small Subsets of Vertices (Q4596825) (← links)
- A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies (Q4997320) (← links)
- Quasi-PTAS for scheduling with precedences using LP hierarchies (Q5002735) (← links)
- Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (Q5117378) (← links)
- Communication-aware scheduling of precedence-constrained tasks on related machines (Q6556208) (← links)