Pages that link to "Item:Q2884295"

The following pages link to On the approximability of single-machine scheduling with precedence constraints (Q2884295):

Displaying 30 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)
• Approximation algorithms for inventory constrained scheduling on a single machine (Q906561) (← links)
• A monotone approximation algorithm for scheduling with precedence constraints (Q935240) (← 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)
• An improved precedence rule for single machine sequencing problems with quadratic penalty (Q1580988) (← 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)
• Precedence constrained scheduling to minimize sum of weighted completion times on a single machine (Q1961232) (← links)
• Precedence theorems and dynamic programming for the single-machine weighted tardiness problem (Q1991104) (← links)
• On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times (Q2094381) (← links)
• Scheduling of tasks with effectiveness precedence constraints (Q2300636) (← links)
• Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint (Q2371343) (← 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)
• Conditional hardness of precedence constrained scheduling on identical machines (Q2875202) (← links)
• A short note on the approximation of the single machine scheduling problem to minimize makespan with fixed jobs and precedence constraints (Q3402964) (← links)
• (Q3775317) (← links)
• (Q3790929) (← links)
• (Q4494459) (← links)
• On Submodular Search and Machine Scheduling (Q5108249) (← links)
• Decision diagrams for solving a job scheduling problem under precedence constraints (Q5140712) (← links)
• Single-Machine Scheduling with Precedence Constraints (Q5387960) (← links)
• Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems (Q5470732) (← 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)