Abstract
Good management of industrial processes lead to optimization problems. Some of them are NP-hard and needs special algorithms to be solved. One such problem is cutting stock problem (CSP). The accurate and fast cutting out with less possible waste is very important element from the working process. The aim is to cut 2D items from rectangular stock, minimizing the waste. The problem is very difficult and the most of the authors solve the simplified version of the problem when the items are rectangular. The computational time increases exponentially when the number of items increase. Finding the optimal solution for large-sized problems for a reasonable time is impossible. Therefore exact algorithms and traditional numerical methods can be apply only on very small problems, less than 100 items. We propose an approximate algorithm which solve the problem when the items are polygons.