Pages that link to "Item:Q1373152"

The following pages link to Pseudopolynomial algorithms for CTV minimization in single machine scheduling (Q1373152):

Displaying 8 items.

• A lower bound for weighted completion time variance (Q613431) (← links)
• Job scheduling methods for reducing waiting time variance (Q878584) (← links)
• Bounds for the position of the smallest job in completion time variance minimization (Q1296376) (← 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)
• Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests (Q2583511) (← links)
• Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm (Q3430246) (← links)
• Time-flexible min completion time variance in a single machine by quadratic programming (Q6090146) (← links)