Abstract
A cutting stock problem against flawed and connectable resource is a kind of a constrained two-dimensional orthogonal guillotine cutting stock problem where orders are assigned to resources. A resource is cut by “sets" which is combinations of fixed cutting blade for length direction, and cut end to end for width direction. Moreover, there are features that flaws that cannot be assigned to orders exist on resources, and that connection which enables to cut several parts of resources by the same set is permitted. This research proposes a method by two phases. In first phase, the rectangles called “available area" which is generated by avoiding flaws and connecting, are created by deciding positions of set change according to an expected extracting rate and a number of set changes. Second, assignment for each available area is done from an order with a larger width by using a branch and bound method in order to achieve a higher yield ratio. At this time, an effective degree of a set pattern is calculated for each useful area. The effective degree means a rate of improvement of an extraction rate per length of an assigned target order. It is possible to decide assignment rapidly by searching a set pattern which has a large effective degree earlier. The proposed method has been applied to a real cutting stock problem.
