Vol. 1 No. 2
Year : 2006
Issue : Nov-Jan
Title : A New Algorithm for the One-Dimensional Cutting Stock Problem
Author Name : Sarath. B. Siyambalapitiya
Synopsis :
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.
No comments:
Post a Comment