Cutting stock problem (CSP) is a of cutting an object into several smaller objects to fulfill the existing demand with minimum unused remaining. Besides minimizing remaining object, sometimes there another additional in CSP, namely number different patterns. This happens because setup cost for each pattern. study shows way obtain patterns (CSP). An example modeled linear programming and then so...

We consider a one-dimensional cutting stock problem (CSP) in which the stock widths are not used to fulfill the order but kept for use in the future for the industrial-use paper production. We present a new model based on the flexible stock allocation and trim loss control to determine the production quantity. We evaluate our approach using a real data and show that we are able to solve industr...

A heuristic particle swarm optimization (HPSO) is proposed as a solution to one-dimensional cutting stock problem (1D-CSP), which incorporate genetic operators into particle swarm optimization (PSO). In this paper, a heuristic strategy that is based on the results of analysis of the optimal cutting pattern of particles with successful search processes is described, which process a global optimi...

In case of the one-dimensional cutting stock problem (CSP) one can observe for any instance a very small gap between the integer optimal value and the continuous relaxation bound. These observations have initiated a series of investigations. An instance possesses the integer roundup property (IRUP) if its gap is smaller than 1. It is well-known that there exist instances of the CSP having a gap...

When making wood board production, defects on board will influence the machining process automation degree. Therefore, how to fast, accurately remove of wood defects and realize optimal combination cutting stock problem has always been a research hotspot in the field of wood processing. According to the decayed wood board, the paper designed the one dimensional optimization cutting stock combin...