THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM USING 2 OBJECTIVES

This paper considers the cutting stock problem with two objectives. Th e primary objective is to minimize the trim loss in a given piece of m etal work requiring metal sections of various lengths. The secondary o bjective is to organize the cutting so that the maximum quantity of le ftovers is accumulated in the last bar(s). This leftover will then be of a length allowing it to be used in the future. An algorithm which p rovides an optimal solution is presented for this problem. However, it may not be efficient for large problems. Consequently, a heuristic ap proach is suggested, with the large problem being divided (decomposed) into smaller ones: the remainder of one problem being used in the nex t. This model was developed for a small metal workshop in a kibbutz.