Pages that link to "Item:Q1961232"
From MaRDI portal
The following pages link to Precedence constrained scheduling to minimize sum of weighted completion times on a single machine (Q1961232):
Displayed 11 items.
- A 2-OPT procedure to reduce total inspection time in a serial inspection process (Q877228) (← links)
- Partially ordered knapsack and applications to scheduling (Q881568) (← links)
- Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints (Q955602) (← links)
- Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523) (← links)
- On the approximability of average completion time scheduling under precedence constraints. (Q1408829) (← links)
- A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time (Q1414243) (← links)
- A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine (Q1970412) (← links)
- Asymptotically optimal schedules for single-server flow shop problems with setup costs and times (Q2488240) (← links)
- A 2-approximation algorithm for the network substitution problem (Q2583715) (← links)
- Vertex Cover in Graphs with Locally Few Colors (Q3012828) (← links)
- Approximating Single Machine Scheduling with Scenarios (Q3541793) (← links)
