This work aims at designing a new algorithm of improved complexity to solve the lot-sizing problem with constant capacities and inventory bounds, in cases where those bounds are higher than twice the production capacity at all time. We build upon previous works by investigating the decomposition of this optimization problem into smaller subplans. New results on the feasibility and optimality of a subplan are proposed that lead to an improved algorithm of cubic worst-case complexity.