One can get an integer solution for the one-dimensional cutting stock problem by means of the constructive or residual heuristic. In this work we propose a change in the Constructive Greedy Heuristic that consists in building a cutting pattern by sorting in descending order the items of pair or odd length, priority being given to those which appear more frequently in the problem, cut from objects in stock with pair or odd length respectively, with the aim of minimizing the quantity of cut objects. Computing tests that were carried out showed the efficiency of the proposed heuristic when compared with other methods in the literature that generate an integer solution for the problem and will be presented at the end of this work.

通过构造或残余启发式方法，可以为一维切削刀具问题获得整数解。在这项工作中，我们提出了一种建设性贪婪启发式方法的更改，该更改包括通过对成对或奇数长度的项目按降序排序来构建切割模式，优先考虑出现在问题中的更频繁的项目，这些项目是从库存物品中切割而来的。分别具有成对或奇数长度，目的是最大程度地减少切割物体的数量。与文献中产生该问题整数解决方案的其他方法相比，所进行的计算测试表明了所提出的启发式方法的效率，该方法将在本工作结束时进行介绍。