JFET_V1_N2_RP5 Sarath B. Siyambalapitiya Journal on Future Engineering and Technology 2230 – 7184 1 2 78 84 heuristic algorithm, One Dimensional Cutting Stock, programming relaxation method, trim loss, stock pieces A fast heuristic algorithm for the solution of one dimensional cutting stock problem which has a wide variety of applications in industrial production planning is presented in this paper. In contrast to common linear programming relaxation methods, a procedure which retains the integrality requirements at each iteration is presented here. Instead of minimizing the trim loss, minimization of the number of stock pieces required to satisfy a given demand is considered. November 2005 - January 2006 Copyright © 2006 i-manager publications. All rights reserved. i-manager Publications http://www.imanagerpublications.com/Article.aspx?ArticleId=963