Pages that link to "Item:Q5387960"

The following pages link to Single-Machine Scheduling with Precedence Constraints (Q5387960):

Displaying 37 items.

• The feedback arc set problem with triangle inequality is a vertex cover problem (Q486997) (← links)
• The precedence constrained knapsack problem: separating maximally violated inequalities (Q494425) (← links)
• Mixed integer formulations using natural variables for single machine scheduling around a common due date (Q827597) (← links)
• Partially ordered knapsack and applications to scheduling (Q881568) (← links)
• Parametric precedence relations in single machine scheduling (Q916560) (← links)
• Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523) (← links)
• Single machine, scheduling problem with fuzzy precedence relation (Q1390285) (← 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)
• An integer programming approach to optimal basic block instruction scheduling for single-issue processors (Q1751173) (← 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)
• A new heuristic and an exact approach for a production planning problem (Q2051214) (← links)
• Integrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routers (Q2077972) (← links)
• Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem (Q2253398) (← links)
• Scheduling of tasks with effectiveness precedence constraints (Q2300636) (← links)
• An exact algorithm for the precedence-constrained single-machine scheduling problem (Q2355863) (← links)
• Online Linear Optimization for Job Scheduling Under Precedence Constraints (Q2835641) (← links)
• Vertex Cover in Graphs with Locally Few Colors (Q3012828) (← links)
• Approximate Deadline-Scheduling with Precedence Constraints (Q3452812) (← links)
• Approximating Single Machine Scheduling with Scenarios (Q3541793) (← links)
• Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem (Q3637403) (← links)
• (Q3775317) (← links)
• Single-Machine Scheduling Polyhedra with Precedence Constraints (Q3971735) (← links)
• (Q4494459) (← links)
• single Machine Preemptive Scheduling With Special Cost Functions¹ (Q4888275) (← links)
• Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651) (← links)
• A General Framework for Approximating Min Sum Ordering Problems (Q5087715) (← links)
• On Submodular Search and Machine Scheduling (Q5108249) (← links)
• Decision diagrams for solving a job scheduling problem under precedence constraints (Q5140712) (← links)
• Order constraints for single machine scheduling with non-linear cost (Q5232495) (← links)
• Integer Programming and Combinatorial Optimization (Q5712461) (← links)
• Equitable scheduling on a single machine (Q6103750) (← links)
• Minimizing I/Os in Out-of-Core Task Tree Scheduling (Q6169958) (← links)
• New partitioning techniques and faster algorithms for approximate interval scheduling (Q6614114) (← links)
• Hardness and approximation of submodular minimum linear ordering problems (Q6634527) (← links)