Pages that link to "Item:Q1324501"
From MaRDI portal
The following pages link to A solvable case of the variance minimization problem (Q1324501):
Displaying 7 items.
- A minimax job completion-time problem revisited (Q1104851) (← links)
- Mimimization of agreeably weighted variance in single machine systems (Q1127158) (← links)
- Completion time variance minimization on a single machine is difficult (Q1317023) (← links)
- Pseudopolynomial algorithms for CTV minimization in single machine scheduling (Q1373152) (← links)
- Completion time variance minimisation on two identical parallel processors (Q1652377) (← links)
- Minimizing completion time variance with compressible processing times (Q1781972) (← links)
- Permutation polyhedra and minimisation of the variance of completion times on a single machine (Q1850996) (← links)