Pages that link to "Item:Q2884295"
From MaRDI portal
The following pages link to On the Approximability of Single-Machine Scheduling with Precedence Constraints (Q2884295):
Displaying 12 items.
- Approximability of scheduling problems with resource consuming jobs (Q256641) (← links)
- Scheduling results applicable to decision-theoretic troubleshooting (Q473374) (← links)
- The feedback arc set problem with triangle inequality is a vertex cover problem (Q486997) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q1755846) (← links)
- A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q2417184) (← links)
- Online Linear Optimization for Job Scheduling Under Precedence Constraints (Q2835641) (← links)
- On Submodular Search and Machine Scheduling (Q5108249) (← links)
- Decision diagrams for solving a job scheduling problem under precedence constraints (Q5140712) (← links)
- Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems (Q5860477) (← links)
- Vertex ordering with precedence constraints (Q6546603) (← links)
- Hardness and approximation of submodular minimum linear ordering problems (Q6634527) (← links)
