The N-Sheet Model in Capacitated Multi-Period Cutting Stock Problem with Pattern Set-Up Cost

Abstract

Cutting Stock Problem (CSP) is a problem to optimize the stock usage with specifics cutting patterns. This research implemented the N-Sheet model in Capacitated Multi-Period Cutting Stock Problem with the pattern set-up cost. This study used the data of the rectangular stocks, which cut to a variety of item sizes. The Pattern Generation (PG) algorithm determined the cutting patterns. The PG produced 21 optimal patterns based on the length and 23 optimal patterns based on the width to fulfil customer requirements. And then, we formulated the patterns into the N-Sheet model. The optimal solution from the N-Sheet model in this research were six cutting patterns. We used the 1st, 2nd, 5th, and 19th patterns for cutting based on length, and the 4th and 23rd patterns for cutting based on the width. The solutions of the model were not so optimal because it yielded too many surplus items.