Pages that link to "Item:Q1755846"
From MaRDI portal
The following pages link to A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q1755846):
Displayed 7 items.
- A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003) (← links)
- A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q2417184) (← links)
- An improved greedy algorithm for stochastic online scheduling on unrelated machines (Q2688463) (← links)
- (Q3304142) (← links)
- An improved approximation algorithm for scheduling under arborescence precedence constraints (Q5089259) (← links)
- Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (Q5117378) (← links)
- Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems (Q5860477) (← links)