應用基因演算法與家族式派工於傳輸整合步進機在小批量情境下之排程問題

A family-based GA algorithm for scheduling in-line stepper in small-lot scenarios

呂佳玟(Chia-Wen Lu)

指導教授 ： 巫木誠

國立交通大學/管理學院/工業工程與管理系所/碩士(2009年)

https://doi.org/10.6842/NCTU.2009.00212

摘要

傳輸整合步進機為半導體工廠中的瓶頸機台，在小批量工件的情境下具有產能損失的問題。加上傳輸整合步進機在加工不同的電路佈局時需要更換光罩，若有過多的光罩更換次數也會導致生產效率不佳。為了解決上述議題，本論文發展一個新的排程方法，結合家族式派工與基因演算法（Family-based Genetic Algorithm ,GA-F），來提高傳輸整合步進機的生產力。此排程方法可以使傳輸整合步進機在具有小批量和光罩設置的情境下提升機台利用率。我們並執行大量實驗比較GA-F與其他兩種的派工法則：GA-FT (traditional family-based genetic algorithm)與GA-I (individual-based genetic algorithm)，實驗結果顯示，GA-F均勝過這兩種派工方法。

關鍵字

排程 ； 半導體 ； 基因演算法 ； 家族式派工

並列摘要

An in-line stepper, a bottleneck machine in a semiconductor fab, may have capacity loss in a small-lot scenario. In such a machine, a setup or mask change is required in processing jobs with different circuit layouts. Different job sequences may require different number of setups and result in different productivity for an in-line stepper. This paper developed a scheduling method (called family-based genetic algorithm, GA-F) in order to increase the machine utilization of in-line steppers, in a small-lot scenario which includes setup characteristics. Two other sequencing methods, called GA-FT (traditional family-based genetic algorithm) and GA-I (individual-based genetic algorithm), are taken as benchmarks and compared with the GA-F method Numeric experiments indicate that the GA-F method outperforms these two benchmarks.

並列關鍵字

scheduling ； semiconductor ； genetic algorithm ； family-based

參考文獻

Bagchi TP, Gupta NDJ and Sriskandarajah C (2006). A review of TSP based approaches for flowshop scheduling. European Journal of Operational Research 169: 816-854.

Cheng TCE, Gupta NDJ and Wang G (2000). A review of flowshop scheduling research with setup times. Production and operations management 9: 262-282.

Chern CC and Liu YL (2003). Family-based scheduling rules of a sequence-dependant wafer fabrication system. IEEE ctions on semiconductor manufacturing 16: 15-25.

Croce FD, Tadei R and Volta G (1995). A genetic algorithm for the job shop problem. Computer Operation Research 22: 15-24.

Franca PM, Gupta JND, Mendes AS, Moscato P and Veltink KJ (2005). Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups. Computers & Industrial Engineering 48: 491-506.