書誌事項
- タイトル別名
-
- A Rapid Scheduling Method by Analysis of Effective flaw Avoidance for a Two-Dimensional Orthogonal Guillotine Cutting Stock Problem for Flawed and Connectable Resources
- 疵あり接合可能2次元ギロチンカット板取問題における疵回避効率分析による高速立案方式
- キズ アリ セツゴウ カノウ 2ジゲン ギロチンカット イタドリ モンダイ ニ オケル キズカイヒ コウリツ ブンセキ ニ ヨル コウソク リツアン ホウシキ
この論文をさがす
説明
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.
収録刊行物
-
- 電気学会論文誌C(電子・情報・システム部門誌)
-
電気学会論文誌C(電子・情報・システム部門誌) 125 (3), 496-501, 2005
一般社団法人 電気学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390001204605614336
-
- NII論文ID
- 10014490447
-
- NII書誌ID
- AN10065950
-
- ISSN
- 13488155
- 03854221
-
- NDL書誌ID
- 7270366
-
- 本文言語コード
- ja
-
- データソース種別
-
- JaLC
- NDLサーチ
- Crossref
- CiNii Articles
- OpenAIRE
-
- 抄録ライセンスフラグ
- 使用不可