An interactive technique for the cutting stock problem with multiple objectives

This paper deals with the two-dimensional cutting stock problem in which a specified number of different rectangular pieces are required to be cut from a stock of sheets of finite dimensions in such a way that several objectives will be satisfied simultaneously. It is shown how this problem can be expressed as a large scale multiple-objective integer linear programming and solved by applying an interactive technique known from multiple criteria decision making. Furthermore, a new cutting procedure is proposed, based on homogeneous strips, to generate cutting patterns with minimum waste. The effectiveness of the interactive technique as well as the cutting procedure is illustrated, in detail, by a numerical example. All the given approaches are implemented on a microcomputer and experimented using real data from an automotive company. Samples of the input/output computer screens and suggestions for future work are also reported.