An Algorithm for Unconstrained Two-dimensional Guillotine Cutting Stock Problem with Defects

• Main Authors: Jiun-Hung Yang, 楊峻泓
• Other Authors: Hsiu-Hsueh Kao
• Format: Others
• Language: en_US
• Published: 2010
• Online Access: http://ndltd.ncl.edu.tw/handle/03562410023292774066

碩士 === 國立中正大學 === 企業管理所 === 98 === Cutting stock problem is one of the well-known NP-hard problems in operations research. Applications of cutting stock problem can found in various industries, such as paper, metal, steel, and the recent high-tech TFT-LCD industry. Motivated by the cutting of LCD panels from defective glass substrate in the TFT-LCD industry, we propose in this thesis an algorithm for the resulting special two-dimensional cutting stock problem with defects. The proposed algorithm consists of two stages: in the first stage, guillotine cuts are used to cut off the defects; in stage 2, dynamic programming model is applied to find the optimal solutions of the resulting smaller non-defective stock rectangles. A simple example is given to illustrate the proposed algorithm, and a real-size problem in the cutting of LCD panels is solved to show the effectiveness of the algorithm.