In this paper the problem of scheduling the production of n products on a single machine is discussed. The objective is to minimize the sum of the set-up, production and storage costs where the product demands are known constants, the planning horizon is infinite and the set-up costs are sequence independent. In order to achieve a general formulation of the problem, the 'variable lot-sizes and the production periods for each of the products are not necessarily equal. A detailed review of the two-stage scheme of (5) is given and its advantages and shortcomings are highlighted. Two new heuristics are suggested to aid in the formation of a good sequence for the above method and their relative performance is tested on a standard problem.