Pages that link to "Item:Q1806342"

The following pages link to Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342):

Displaying 41 items.

• Reconstructing binary matrices with timetabling constraints (Q350725) (← links)
• The feedback arc set problem with triangle inequality is a vertex cover problem (Q486997) (← links)
• On the configuration-LP for scheduling on unrelated machines (Q490331) (← links)
• Approximability of average completion time scheduling on unrelated machines (Q507314) (← links)
• Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree (Q543514) (← links)
• Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays (Q612215) (← links)
• Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (Q716177) (← links)
• Partially ordered knapsack and applications to scheduling (Q881568) (← links)
• Flow shops with WIP and value added costs (Q969753) (← links)
• A note on graph balancing problems with restrictions (Q990093) (← 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)
• Metaheuristics for order scheduling problem with unequal ready times (Q1727107) (← links)
• Minimizing flow time on a constant number of machines with preemption (Q1779706) (← links)
• Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
• The \(C^{\max}\) problem of scheduling multiple groups of jobs on multiple processors at different speeds (Q1953222) (← links)
• Scheduling jobs with release and delivery times subject to nested eligibility constraints (Q2033983) (← links)
• In memoriam: Gerhard Woeginger (1964--2022) (Q2093179) (← links)
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• Parallel machine scheduling with nested job assignment restrictions (Q2270323) (← links)
• Graph balancing: a special case of scheduling unrelated parallel machines (Q2441586) (← links)
• Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
• Approximation schemes for scheduling and covering on unrelated machines (Q2503309) (← links)
• Approximating total flow time on parallel machines (Q2641865) (← links)
• Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
• Online Linear Optimization for Job Scheduling Under Precedence Constraints (Q2835641) (← links)
• Vertex Cover in Graphs with Locally Few Colors (Q3012828) (← links)
• Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530) (← links)
• GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE (Q3434271) (← links)
• Towards Tight Lower Bounds for Scheduling Problems (Q3452775) (← links)
• Approximating Single Machine Scheduling with Scenarios (Q3541793) (← links)
• POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION (Q3646206) (← links)
• Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316) (← links)
• A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies (Q4997320) (← links)
• Quasi-PTAS for scheduling with precedences using LP hierarchies (Q5002735) (← links)
• Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (Q5117378) (← links)
• A Quasi-Polynomial Approximation for the Restricted Assignment Problem (Q5138780) (← links)
• Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds (Q5478829) (← links)
• (Q6065401) (← links)
• Approximations for Throughput Maximization (Q6492088) (← links)