For the problem of lot-sizing on a tree with constant capacities, or stochastic lot-sizing with a scenario tree, we present various reformulations based on mixing sets. We also show how earlier results for uncapacitated problems involving (Q, SQ ) inequalities can be simplified and extended. Finally some limited computational results are presented.