On the one-dimensional cutting stock problem using weld

Recently, the One-Dimensional Cutting-Stock Problem (CSP) which is encountered in many industrial areas such as steel, wood, plastic and paper industries, is a common problem in operational researches. Main purpose of the classical One-Dimensional-Cutting-Stock Problem is to minimize the loss originating from the cutting processes when order of the clients are provided. To further minimize the loss amount, skiving option calculations have been came into question, recently. For example, some of the companies in steel industry aim to lower the loss with splitting the orders of the clients into smaller pieces, then welding these pieces back together. In an another example, in paper industry, skiving option can reduce the loss. However, because welding and skiving create an extra cost, classical cutting stock problem has evolved to a new One-Dimensional Cutting Stock Problem with Two Objective Function, which grants the minimization of both the amount of loss and welding or skiving counts. In this thesis, CSP was investigated with literature review. Besides, heuristic algorithms, which are based on dynamical programming, were evaluated on recent real-life, large-sized problems.