Pages that link to "Item:Q1970412"

The following pages link to A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine (Q1970412):

Displaying 22 items.

• Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations (Q322692) (← links)
• Partially ordered knapsack and applications to scheduling (Q881568) (← links)
• Scheduling and fixed-parameter tractability (Q896271) (← 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)
• Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
• An integer programming approach to optimal basic block instruction scheduling for single-issue processors (Q1751173) (← links)
• Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times (Q2147050) (← links)
• Classes of linear programs solvable by coordinate-wise minimization (Q2163850) (← links)
• Parameterized multi-scenario single-machine scheduling problems (Q2196612) (← links)
• Approximation algorithms for scheduling problems with a modified total weighted tardiness objective (Q2465959) (← links)
• Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
• A 2-approximation algorithm for the network substitution problem (Q2583715) (← links)
• Online Linear Optimization for Job Scheduling Under Precedence Constraints (Q2835641) (← links)
• Vertex Cover in Graphs with Locally Few Colors (Q3012828) (← links)
• Approximating Single Machine Scheduling with Scenarios (Q3541793) (← 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)
• A state-of-the-art survey on multi-scenario scheduling (Q6113303) (← links)