中文摘要：

研究和分析了少量多样生产环境下的PCB组装生产效率优化问题，并针对该问题建立了基于最小化调整时间策略的数学模型；优化问题的目标是确定批量生产时不同类型PCB板的最佳组装顺序以最小化调整时间，可近似描述为一个非对称旅行商问题（ATSP）；提出了基于最近邻算法和2-opt算法的混合启发式算法求解该问题：先采用最近邻算法快速产生初始解，再用2～opt算法对初始解进行改良，最终得到问题的近似最优解；仿真数据表明，该算法具有优化效果好、性能稳定的优点。

英文摘要：

The optimization problem of high-mix and low-volume PCB assembly is studied and the mathematical model for it under the minimum setup-time strategy is built. Aiming at obtaining an optimal assembly sequence for different types of PCBs, the optimization problem can be de scribed as an Asymmetric Traveling Salesman Problem （ATSP）. A combined heuristic algorithm based on the nearest neighborhood algorithm and the 2-opt algorithm is presented to solve the problem, the former is used to generate an initial solution and the latter is used to improve the initial solution and obtain a sub-optimal solution. The simulation results show that the proposed algorithm has good and steady performance.