Pages that link to "Item:Q1414243"
From MaRDI portal
The following pages link to A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time (Q1414243):
Displaying 10 items.
- Partially ordered knapsack and applications to scheduling (Q881568) (← links)
- Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523) (← links)
- Approximation results for a bicriteria job scheduling problem on a single machine without preemption (Q1041716) (← links)
- On the approximability of average completion time scheduling under precedence constraints. (Q1408829) (← links)
- The benefit of preemption for single machine scheduling so as to minimize total weighted completion time (Q1709959) (← links)
- Precedence constrained scheduling to minimize sum of weighted completion times on a single machine (Q1961232) (← links)
- A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine (Q1970412) (← links)
- A 2-approximation algorithm for the network substitution problem (Q2583715) (← links)
- Machine Scheduling to Minimize Weighted Completion Times (Q4636336) (← links)
- On Submodular Search and Machine Scheduling (Q5108249) (← links)
