Anwar Mohammadi - Sharif University of Technology Department of Mathematics and Computer Sciences
Ehsanollah Gholami - Amirkabir University of Technology Department of computer Engineering and Information Technology

The cutting stock problem is an important problem in combinational optimization. In classic versions of this problem, the aim is to find a solution for cutting some equal-width mother rolls into amaller parts with given width so that the amount of trim-loss become as small as possible. there are a plenty of works which adsressed the classic cutting stock problem. However in real world applications there are usually some constraints which make the problem different from classical version and make it harder to solve. In this paper we investigate an instance of cutting stock problem in film industry and show that it can not be solved by using previus methods. we propose a new hybrid method which combines previos methods and takes into account the constraints of this problem. We applied our method on real data from a film production factory. The experimants show that our method can solve this problem efficiently and outperforms the previous methods.

cutting Stock Problem, Linear Programming, Heuristic methods