【摘要】 在分析柔性jobshop调度问题特点的基础上,提出一种新的求解该问题的遗传算法,即利用编码方法表示各工序的优先调度顺序及工序的加工机器,由此产生可行的调度方案,使得问题的约束条件在染色体中得以体现.所设计的遗传算子不仅能避免非法调度解的出现,保证后代的多样性,而且可使算法具有记忆功能.仿真结果证明了该算法的有效性.更多还原

【Abstract】 Based on the analysis of the characteristic of flexible job shop scheduling problem, a new genetic algorithm is presented. The encoding method represents the priority dispatching sequence and machines where each operation can be processed. Then, the feasible schedules are found and the constraints are explained in the chromosome. The genetic operators not only avoid the illegal schemes and ensure the diversification of evolving descendants, but also make the algorithm have memory function. The simulation results validate the effectiveness of the proposed (algorithm.)更多还原