工業用紙工廠紙張裁剪模式之探討

the investigation of paper-cutting models

廖文鈺(Wen-Yu Liao)

指導教授 ： 張百棧

元智大學/工程學院/工業工程與管理學系/碩士(1995年)

摘要

摘 要

在實際產業生產狀況裡，工廠紙張的裁剪或切割通常是將相同尺寸大小紙
張擺在一起切割，因此本研究主要目的是希望能提出經濟有效的切割方法
，並符合實際切割情形，使紙張浪費最少或價值最高；在傳統的切割問題
上，是用整數線性規劃來求解，因此限制式的嚴謹與否，常常決定目標式
的值，如果忽略紙張形狀的特性，則將造成紙張切割的很大浪費。在這裡
，我們用某幾種需求的組合來討論如何減少浪費，藉此找出紙張分區的數
目及切割圖案，並對切割圖案做比較，以找出其中較佳切割組合來供使用
者決定，而使得浪費較少且降低切割複雜度。

關鍵詞：切割組合、切割圖案、複雜度。

關鍵字

切割組合 ； 切割圖案 ； 複雜度

並列摘要

ABSTRACT

In practical production situations of the factory, the worker
will get together the same size of papers and cut them off at
the same time. Therefore ,the major focus of this research is to
identify an economical way of cutting paper, thus a minimized
cost will be achieved. In convention, the linear programming
is applied as a fundamental tool for the optimization of
paper cutting problems. However, the disadvantages of this
approach is that normally people will ignore the special size
of the paper an do not form a particular constraint for it,
thus the linear programming will not work properly and you
will just get a secondary good solution. In this research ,we
will try to organize the possible way of combining the width or
length of the paper to form a special cutting pattern, thus the
cutting process can be proceeded in different ways. Heuristics
will also be provided to explore possible solutions with
satisfactory results and these results will be examined
through extensive simulation processes. Finally, a
computationally efficient algorithm will be developed to
solve the problem with practical sizes.

Keywords：cutting combinations, cutting patterns, complexities.

並列關鍵字

cutting combinations ； cutting patterns ； complexities