A scenario relaxation algorithm for finite scenario based robust assembly line balancing  

作　　者：徐炜达 Xiao Tianyuan 

机构地区：[1]Department of Automation, Tsinghua University, Beijing 100084, P . R. China

出　　处：《High Technology Letters》2011年第1期1-6,共6页高技术通讯（英文版）

基　　金：Supported by the National High Technology Research and Development Programme of China （No. 2006AA04Z160） and the National Natural Science Foundation of China （ No. 60874066）.

摘　　要：A balancing problem for a mixed model assembly line with uncertain task processmg Ume anO daily model mixed changes is considered, and the objective is to minimize the work variances between stations in the line. For the balancing problem for the scenario-based robust assembly line with a finitely large number of potential scenarios, the direct solution methodology considering all potential scenarios is quite time-consuming. A scenario relaxation algorithm that embeds genetic al- gorithm is developed. This new algorithm guarantees termination at an optimal robust solution with relatively short running time, and makes it possible to solve robust problems with large quantities of potential scenarios. Extensive computational results are reported to show the efficiency and effectiveness of the proposed algorithm.

关 键 词：scenario-based decision making robust optimization assembly line balancing genetic algorithm 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] G633.7[自动化与计算机技术—控制科学与工程]