A heuristic for the one-dimensional cutting stock problem with usable leftover |
| |
| Authors: | Yaodong Cui Yuli Yang |
| |
| Institution: | 1. School of Computer, Electronics and Information, Guangxi University, Nanning 530004, China;2. Department of Public Computer Teaching, Yuncheng University, Yuncheng 044000, China |
| |
| Abstract: | 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. |
| |
| Keywords: | Cutting stock One-dimensional cutting Multi-objective Residual length |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
