Prethodno priopćenje

https://doi.org/10.17559/TV-20160427184747

One-Dimensional Cutting Stock Optimisation by Suborders

Mirko Gradišar ; University of Ljubljana, Faculty of Economics, Kardeljeva Ploščad 17, 1000 Ljubljana, Slovenia
Mihael Cesar orcid.org/0000-0002-6473-3989 ; University of Ljubljana, Faculty of Economics, Kardeljeva Ploščad 17, 1000 Ljubljana, Slovenia
Luka Tomat orcid.org/0000-0003-2063-1777 ; University of Ljubljana, Faculty of Economics, Kardeljeva Ploščad 17, 1000 Ljubljana, Slovenia

Sažetak

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.

Ključne riječi

algorithm; cutting stock problem; discrete optimisation; large order

Hrčak ID:

205946

URI

https://hrcak.srce.hr/205946

Datum izdavanja:

22.9.2018.

Posjeta: 1.706 *