One-Dimensional Cutting Stock Optimisation by Suborders

被引：1
|
作者：
Gradisar, Mirko [1 ]
Cesar, Mihael [1 ]
Tomat, Luka [1 ]
机构：
[1] Univ Ljubljana, Fac Econ, Kardeljeva Ploscad 17, Ljubljana 1000, Slovenia
来源：
TEHNICKI VJESNIK-TECHNICAL GAZETTE | 2018年 / 25卷
关键词：
algorithm; cutting stock problem; discrete optimisation; large order; PROGRAMMING APPROACH; STAINLESS-STEEL; ALGORITHM;
D O I：
10.17559/TV-20160427184747
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
This paper introduces a method for solving a one-dimensional cutting stock problem by suborders. The method is used for large orders that for technological and logistical reasons cannot be filled in a single order, but only in several successive suborders. The method has two stages. In the first stage, the suborders are generated and in the second the trim-loss is minimised. All leftovers longer than D are returned to stock and reused. Shorter leftovers are treated as trim-loss and discarded. A detailed description of the method is provided by using a practical case. The method is tested by solving 108 randomly generated problem instances.
引用
收藏
页码：474 / 480
页数：7
相关论文
共 50 条
12345