Pages that link to "Item:Q1805454"

The following pages link to New results on the completion time variance minimization (Q1805454):

Displaying 31 items.

• Maximizing total tardiness on a single machine in \(O(n^2)\) time via a reduction to half-product minimization (Q256707) (← links)
• Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product (Q257209) (← links)
• Scheduling chains to minimize mean flow time (Q290213) (← links)
• A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties (Q339632) (← links)
• `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders (Q602755) (← links)
• A lower bound for weighted completion time variance (Q613431) (← links)
• Pseudo-Boolean optimization (Q697569) (← links)
• A half-product based approximation scheme for agreeably weighted completion time variance (Q707130) (← links)
• Job scheduling methods for reducing waiting time variance (Q878584) (← links)
• Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008) (← links)
• FPTAS for half-products minimization with scheduling applications (Q1005250) (← links)
• A tight lower bound for the completion time variance problem (Q1268251) (← links)
• Bounds for the position of the smallest job in completion time variance minimization (Q1296376) (← links)
• Completion time variance minimization on a single machine is difficult (Q1317023) (← links)
• Pseudopolynomial algorithms for CTV minimization in single machine scheduling (Q1373152) (← links)
• Multi-machine scheduling with variance minimization (Q1392562) (← links)
• Fast fully polynomial approximation schemes for minimizing completion time variance (Q1600838) (← links)
• A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
• Minimization of ordered, symmetric half-products (Q1763481) (← links)
• Positive half-products and scheduling with controllable processing times (Q1772845) (← links)
• A combinatorial approach to level of repair analysis (Q1840842) (← links)
• The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
• A branch and price algorithm for single-machine completion time variance (Q2003576) (← links)
• Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection (Q2098030) (← links)
• An almost exact solution to the min completion time variance in a single machine (Q2239979) (← links)
• Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291) (← links)
• Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance (Q2434334) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
• Introduction to QUBO (Q5050141) (← links)
• Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
• Fast Heuristics and Approximation Algorithms (Q5050148) (← links)