A MILP model for one dimensional cutting stock problem with adjustable leftover threshold and cutting cost

This paper presents a MILP model for one dimensional cutting stock (CSP) problems that considers the most commonly used objectives all together. These are the minimization of the trim loss which is the leftover that is not large enough to be reused in the future, minimization of the total cutting cost and number of bars involved. We carried out computational experiments in order to find out the limitations of our model and to compare it with the most commom linear cutting software on the market.