A preventive replacement problem is formulated in discrete time for a multicomponent system having non identical elements. The components are assumed to be s-independent but there is a possibility of economies of scale in the replacement activity. The Dynamic Programming equation is obtained and some useful properties of the Bellman value function are stated. An algoritrhm for the numerical computation of optimal and suboptimal replacement strategies is proposed. A numerical illustration is developped.