中文摘要：

研究了一类无缓冲区的汽车涂装车间喷漆生产排序问题.给出了一种数学模型,该模型以喷涂颜色改变次数最少为目标,并要求保持焊装车间产出白车身类型的顺序.为解决这一问题,设计了一种遗传算法.该算法采用子串交换实现交叉,采用互换算子实现变异,其优点在于减少了遗传过程中的修补工作量.通过一个实际的例子验证了该算法.计算结果显示,所设计的算法能够较好地求解上述模型.该研究对焊装车间与涂装车间之间未设置线性缓存系统或采用先进先出（FIFO）缓存系统的汽车制造企业具有较好的实用价值.

英文摘要：

A kind of paint-shop sequencing problem without sorting buffer existed between body-shop and paint-shop is studied in this paper.The mathematics model is introduced which aimed to minimize the times of color-changeover.Accordingly,a genetic algorithm（GA） approach is proposed to trackle this problem.The proposed GA algorithm reduces the repair work after crossing and mutating operates by employing the subsequence exchange crossover and the reciprocal exchange mutation.To demonstrate the performance of the proposed method,a case study based on real world production is given.The result shows that the algorithm is practical and effective.This mode and its solution will contribute to the automobile factories which does not introduce sorting buffer or just employs a FIFO（first-in first-out） type buffer between their body-shop and paint-shop.