The Study of Polarizer Cutting Plan Scheduling Problem

• Main Authors: Tung-JuWu, 吳東儒
• Other Authors: Yueh-Min Huang
• Format: Others
• Language: zh-TW
• Published: 2012
• Online Access: http://ndltd.ncl.edu.tw/handle/56696300284097233237

碩士 === 國立成功大學 === 工程科學系專班 === 100 === Polarizer Cutting Plan (PCP) is based on the month of customer orders, demand for a variety of different specifications of the polarizer, and selects the appropriate cutting mold and cutting sequence, arrangement of the polarizer cutting plan. There is no related work was seen before about this scheduling problem. This work is the first article study about the polarizer cutting scheduling problem. There are three methods are adopted in the scheduling system. First, we propose an automatic scheduling algorithm by reducing material approach for minimizing the polarizer material usage to save the consumption cost of the materials. Then, using the appropriate greedy method to find the near the optimal solution. Finally, this study proposes a particle swarm optimization algorithm for minimizing the polarizer material usage. Furthermore, according to the rule of artificial way, we utilize the computer system automation to optimize the arrangement of cutting plan, Material Savings and the Inventory Reduction without increasing any fixed and variable costs. Experimental results demonstrate the robustness of the proposed PSO algorithm in terms of solution quality.