Pages that link to "Item:Q2239979"

The following pages link to An almost exact solution to the min completion time variance in a single machine (Q2239979):

Displaying 7 items.

• A tight lower bound for the completion time variance problem (Q1268251) (← links)
• A branch and bound algorithm to minimize completion time variance on a single processor. (Q1413810) (← 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)
• Minimising variance of job completion times in a single machine (Q2627247) (← links)
• Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem (Q4261219) (← links)
• Time-flexible min completion time variance in a single machine by quadratic programming (Q6090146) (← links)