Pages that link to "Item:Q2417184"
From MaRDI portal
The following pages link to A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q2417184):
Displayed 5 items.
- Approximation algorithms for some position-dependent scheduling problems (Q2217459) (← links)
- A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003) (← links)
- Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates (Q2294224) (← links)
- Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems (Q5860477) (← links)
- Approximation Algorithms for Generalized Path Scheduling (Q6065400) (← links)