A rapid scheduling method with resource selection by flaw analysis for a rectangular cutting stock problem against flawed and connectable resources

The target of this research is a rectangular cutting stock problem against flawed resources that orders are assigned to the resources avoiding flaws and connecting the resources for efficient assignment. The problem has the feature that total area of all resources is larger than one of orders, so that, first the resources used for assignment are selected from all resources. In order to effectively use the "cumbersome resources", whose assignment evaluation tends to be small, in this research, two methods are proposed; a method of formulizing degree of a cumbersome resource, and a method to connect divided resources effectively. In the former method, the degree is expressed from two factors, namely rate of flaws' area and complexity of flaws, and the parameter is added to a total evaluation. In the latter, "improvement degree" of a pair of divided resources is introduced, and the pair whose improvement degree is high, is connected. The proposed method has been applied to real cutting stock problems. It is confirmed that the method can generate the solutions as same level as expert's solutions.