Pages that link to "Item:Q3452775"
From MaRDI portal
The following pages link to Towards Tight Lower Bounds for Scheduling Problems (Q3452775):
Displaying 4 items.
- Approximation Algorithms for Scheduling with Resource and Precedence Constraints (Q3304123) (← 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)
