What is an algorithm for minimizing the standard deviation of m sums summed from n summands? [with attempt]
No, your algorithm does not always produce the optimal solution.  When $m=2$, this is (at least as hard as) the Partition problem, which is NP-hard.  Wikipedia discusses the greedy algorithm and lists a counterexample which shows that your algorithm does not work.