This paper describes a solution technique for a general class of problems referred to as aggregate planning and master scheduling problems. The technique is also applicable to multi-item single level capacitated lot sizing problems. The solution technique presented here is a heuristic that is practical for large problems e.g. 9 products and 36 periods. We have tested it for problems with varying number of time periods, number of products, setup costs, holding costs, overtime costs and capacity levels. For those problems that we could solve exactly using a branch and bound algorithm, the solutions produced by the heuristic were all within 1 % of optimality. For problems that we could not solve exactly, we are able to compute a lower bound on the optimal cost. Using the bound we are able to show that our heuristic solutions were within 2.93% of optimality on the average. Except for those problems having very high setup cost or problems with extreme seasonality, the algorithm produced solutions that were within 1 % of optimality on average.