A heuristic for the one-dimensional cutting stock problem with usable leftover

作者：Cui, Yaodong^*; Yang, Yuli

来源：European Journal of Operational Research, 2010, 204(2): 245-250.

DOI：10.1016/j.ejor.2009.10.028

• Cutting stock
• One-dimensional cutting
• Multi-objective
• Residual length

A heuristic algorithm for the one-dimensional cutting stock problem with usable leftover (residual length) is presented. The algorithm consists of two procedures. The first is a linear programming procedure that fulfills the major portion of the item demand. The second is a sequential heuristic procedure that fulfills the remaining portion of the item demand. The algorithm can balance the cost of the consumed bars, the profit from leftovers and the profit from shorter stocks reduction. The computational results show that the algorithm performs better than a recently published algorithm.

• 出版日期2010-7-16
• 单位广西大学; 运城学院