Pages that link to "Item:Q1850996"
From MaRDI portal
The following pages link to Permutation polyhedra and minimisation of the variance of completion times on a single machine (Q1850996):
Displayed 3 items.
- A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights (Q1742901) (← links)
- An efficient local search for minimizing completion time variance in permutation flow shops (Q1762072) (← links)
- A branch and price algorithm for single-machine completion time variance (Q2003576) (← links)