修剪
舍入
库存(枪支)
残余物
数学优化
计算机科学
运筹学
数学
工程类
算法
机械工程
操作系统
作者
Ravi Vishwakarma,P. L. Powar
标识
DOI:10.1016/j.aime.2021.100046
摘要
The cutting process is an important stage of the industries which are dealing with cutting of small pieces from large items in such a way so that the wastage should be minimum. In this study, we present an effective model for solving one-dimensional cutting stock problem (1D-CSP) using sustainable trim based on Cesàro means of order λ (λ is real >−1), with the provision of cutting at most two order lengths at a time, which is acceptable in many practical cases. Additionally, we present the comparison of the model with Residual Greedy Rounding (RGR) and CUT. It is shown that increased sustainable trim decreases the total trim loss by providing greater variety of stock lengths, which can be effectively used in future orders.
科研通智能强力驱动
Strongly Powered by AbleSci AI