论文部分内容阅读
Job -shop调度问题是一个强NP -难问题 .为此提出了一种简单、易操作的遗传算法对该问题进行求解 .采用一种插入式贪婪解码算法保证生成的调度是活动调度 (activeschedule) .通过几个著名的MuthandThomp son测试例子及与目前较好的遗传算法的比较实验 ,以验证这一算法的有效性 .
Job -shop scheduling problem is a strong NP-hard problem. For this reason, a simple and easy-to-use genetic algorithm is proposed to solve this problem. A plug-in greedy decoding algorithm is used to ensure that the generated schedule is active scheduling. Several well-known MuthandThomp son test examples and comparative experiments with currently well-established genetic algorithms are used to verify the effectiveness of this algorithm.