| Summary: | 碩士 === 國立成功大學 === 工業與資訊管理學系 === 104 === This study investigates the two-dimensional cutting problem with angle restriction (AR2DCP), in which each product has to be cut with a specific angle. The cutting problem has been extensively studied in the TFT-LCD industry. There are two cutting processes, single-stage process and multi-stage process, in the TFT-LCD industry. We develop the angle restricted cutting (ARC) algorithm based on column generation for the single-stage cutting process. Additionally, we develop the maximal utilization (MU) and angle restricted guillotine cutting (ARGC) algorithms for the multi-stage cutting process. The use of the ARC and ARGC algorithms can obtain the optimal solution for a small-sized problem. For large-sized problems, the feasible solutions can be obtained from the MU algorithm, which would cause less trim loss.
|
|---|
