Application of column generation approach in minimizing waste and predicting future inventory of one dimensional cutting stock problem

This research considers the problem of minimizing waste in a paper cutting operation. The operation begins with that some parent rolls of indicated widths are to be cut to fill orders for rolls of specified widths. The objective of this study is to find out the way to carry out the required cutting operation and will produce the smallest amount of waste by exploiting linear programming. A C program has been written to solve the entire problem using the ideas of linear programming combined with the algorithm for solving knapsack problem. Simulation results are generated to show the amount of inventory versus time and we apply ARIMA model to forecast future inventory.