Pages that link to "Item:Q613431"

The following pages link to A lower bound for weighted completion time variance (Q613431):

Displaying 10 items.

• A half-product based approximation scheme for agreeably weighted completion time variance (Q707130) (← links)
• A tight lower bound for the completion time variance problem (Q1268251) (← links)
• On the flexibility of a decision theory-based heuristic for single machine scheduling (Q1628046) (← links)
• Minimizing the weighted sum of completion times under processing time uncertainty (Q1742192) (← links)
• The single machine weighted mean squared deviation problem (Q1753598) (← 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)
• Mean completion time for a randomly varying rate of work (Q3383681) (← links)
• Time-flexible min completion time variance in a single machine by quadratic programming (Q6090146) (← links)