Pages that link to "Item:Q613431"
From MaRDI portal
The following pages link to A lower bound for weighted completion time variance (Q613431):
Displayed 6 items.
- On the flexibility of a decision theory-based heuristic for single machine scheduling (Q1628046) (← 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)
- Time-flexible min completion time variance in a single machine by quadratic programming (Q6090146) (← links)