In this paper, we address a new variant of the cutting stock problem, in which skiving is
allowed and setup costs are considered. Specifically, the output sheets are generally longer …

This paper investigates the one-dimensional cutting stock problem considering two
conflicting objective functions: minimization of both the number of objects and the number of …

Even though the body of literature in the area of cutting and packing is growing rapidly,
research seems to focus on standard problems in the first place, while practical aspects are …

This work presents a genetic symbiotic algorithm to minimize the number of objects and the
setup in a one-dimensional cutting stock problem. The algorithm implemented can generate …

This paper addresses a two-dimensional cutting stock problem arising in furniture factories.
The problem involves the simultaneous optimization of two, usually conflicting, objectives …

This work presents a genetic symbiotic algorithm to solve the one-dimensional cutting stock
problem with multiple objectives. We considered two important objectives for an industry (1) …

In this paper the cutting stock problem minimizing saw cycles is considered. In this context
where objects can be cut simultaneously the trade-off between raw material and machine …

More than ten billion tons of construction waste are generated every year in the world. The
large volume of construction waste not only increases costs for contractors, but also poses a …

In our world the day to day life many industries use a significant problem which is termed as
Cutting stock problem. Here both the single sheet length and multiple sheet length cutting …

In this thesis, we study the multi-period one dimensional cutting stock problem minimizing
setup costs on cutting patterns. We first propose an extensive range of patternbased and …