中文摘要：

为了解决带有限中间缓冲区的多级并行机问题，以最小化最大完工时间为优化目标，设计了一种基于遗传算法和模拟退火算法的混合求解算法．在此算法中，搜索空间被限制在第1工位工件投产序列的置换向量空间内．提出了一种由第1工位工件投产序列向量构造整个调度方案的方法，并采用混合交叉算子和变异算子的策略对选择算子进行了设计．通过与现有的计算结果进行比较，证明了此算法的可行性和优越性．

英文摘要：

The multi-stage parallel machine problem with limited intermediate buffers was dealt with. The optimization objective is to minimize the makespan. A hybrid algorithm was developed for solving this problem, which was based on genetic algorithm and simulated annealing algorithm. In this algorithm, the search was limited to the space of permutation vectors of the order in which a given set of jobs were performed in the first stage. A procedure to construct a complete schedule associated with every permutation vector was proposed. Moreover, a new selection procedure was proposed and hybrid crossover operators and mutation operators were adopted. The computational experiment was conducted using the instances from the open literature. The comparison results showed that the proposed algorithm is a feasible and effective method for solving this problem.