Pages that link to "Item:Q4490785"
From MaRDI portal
The following pages link to Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler (Q4490785):
Displaying 12 items.
- Partially ordered knapsack and applications to scheduling (Q881568) (← links)
- Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523) (← links)
- Gantt charts: A centenary appreciation. (Q1399588) (← links)
- On the approximability of average completion time scheduling under precedence constraints. (Q1408829) (← links)
- Optimal algorithms for scheduling under time-of-use tariffs (Q2241552) (← links)
- Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
- Asymptotically optimal schedules for single-server flow shop problems with setup costs and times (Q2488240) (← links)
- The constrained minimum weighted sum of job completion times problem (Q2494511) (← links)
- On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems (Q2503352) (← links)
- Dual Techniques for Scheduling on a Machine with Varying Speed (Q3174696) (← links)
- SPT optimality (mostly) via linear programming (Q6161291) (← links)
- Total completion time scheduling under scenarios (Q6574934) (← links)