论文部分内容阅读
车间作业调度问题是个典型的NP-hard问题,为了更有效的解决车间作业调度问题,提出了一种改进的混合算法(IGASA).算法设计了一种基于当前最优解的免疫算子,算子对当前最优个体中选取运行时间最少的一台机器上的工件顺序当作疫苗,并用车间调度问题的图论模型解释了此算子的合理性.最后通过大量实验证明改进的混合算法的性能的优越性,从而证明设计的免疫算子是有意义的.
The job shop scheduling problem is a typical NP-hard problem. In order to solve the job shop scheduling problem more effectively, an improved hybrid algorithm (IGASA) is proposed. The algorithm designs an immune operator based on the current optimal solution, The subgroups of the current best individual are selected as the vaccine with the least running time on a machine, and the rationality of the operator is illustrated by the graph theory model of the shop scheduling problem. Finally, a large number of experiments prove that the improved hybrid algorithm The superiority of performance, which proves the design of the immune operator makes sense.