Algorithms for the one-dimensional two-stage cutting stock problem

2018 ◽  
Vol 271 (1) ◽  
pp. 20-32 ◽  
Author(s):  
İbrahim Muter ◽  
Zeynep Sezer
Keyword(s):  
Cutting Stock Problem ◽  
Cutting Stock ◽  
Two Stage ◽  
One Dimensional ◽  
The One

A balance approach for the one-dimensional multiple stock size cutting stock problem with setup cost

2016 ◽  
Vol 230 (12) ◽  
pp. 2182-2189 ◽  
Author(s):  
Dianjian Wu ◽  
Chunping Yan
Keyword(s):  
Pattern Generation ◽  
Cutting Stock Problem ◽  
Cutting Stock ◽  
Setup Cost ◽  
Stock Size ◽  
One Dimensional ◽  
Setup Costs ◽  
Balance Approach ◽  
The One ◽  
Cutting Plan

A balance approach is presented to solve one-dimensional multiple stock size cutting stock problem with setup cost. The approach first utilizes a sequential pattern generation algorithm to generate a series of cutting plans based on each stock size, respectively. Then, a measure standard of cost balance utilization is used to select a current optimized cutting pattern from a cutting plan corresponding to each stock size. All item demands are dealt by the previous two steps to obtain many optimized cutting plans, and an ideal cutting plan is extracted according to the minimum sum of stock and setup costs at last. The approach is applied to two tests, and the computational results demonstrate that it possesses good cost adaptability and optimization performance.

scholarly journals Minimal Proper Non-IRUP Instances of the One-Dimensional Cutting Stock Problem

2014 ◽  
Author(s):  
Vadim M. Kartak ◽  
Artem V. Ripatti ◽  
Guntram Scheithauer ◽  
Sascha Kurz
Keyword(s):  
Cutting Stock Problem ◽  
Cutting Stock ◽  
One Dimensional ◽  
The One

scholarly journals A software for the one-dimensional cutting stock problem

2011 ◽  
Vol 23 (1) ◽  
pp. 69-76 ◽  
Author(s):  
Murat Erşen Berberler ◽  
Urfat Nuriyev ◽  
Ahmet Yıldırım
Keyword(s):  
Cutting Stock Problem ◽  
Cutting Stock ◽  
One Dimensional ◽  
The One
Sign in / Sign up

Export Citation Format

Share Document