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 4 items.
- Partially ordered knapsack and applications to scheduling (Q881568) (← links)
- Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523) (← links)
- A 2-approximation algorithm for the network substitution problem (Q2583715) (← links)
- On Submodular Search and Machine Scheduling (Q5108249) (← links)