This paper  reports an approach  developed to find a good quality solution for a generalized assignment problem with application to the <span name="style_italic">Dimensional  Cutting Problem</span>.  The objective at the <span name="style_italic">Cutting Problem</span> is to divide different pools of pieces of the same dimension  among different items of available  material all having  two dimensions,  the width  and  length.   The  solution  is found  keeping  the largest  number  of pieces  in  a single material.   Some initial numerical  experiences found for the algorithm optimal and  suboptimal solutions or instances of more than 500 pieces at a very low computational cost. is to divide different pools of pieces of the same dimension  among different items of available  material all having  two dimensions,  the width  and  length.   The  solution  is found  keeping  the largest  number  of pieces  in  a single material.   Some initial numerical  experiences found for the algorithm optimal and  suboptimal solutions or instances of more than 500 pieces at a very low computational cost.

Heurísticas; algoritmo goloso; algoritmo backtrack; problema unidimensional  de cortes