用单亲遗传算法解具有窗口式交货期的多机加工排序问题

Solving Machines Process Sequencing Problem with Due Date Windows by IPGA

具有窗口式交货期的加工排序问题是一个强 NP困难问题 ,传统方法的计算效果往往不能令人满意。采用基于整数编码的单亲遗传算法较成功地解决了这类窗口式交货期的单机和多机加工排序问题 ,并讨论了该算法的计算复杂性是属可计算的。文中的算例表明 。

Machines process sequencing problem with due date windows in NP hard in the strong sense, traditional algorithms usually are not satisfied. In the paper, we successfully solved the machines process sequencing problem with due date windows by integer coded partheno genetic algorithm, and discussed that complexity of the algorithm is feasible. The numerical experiments show the effectiveness of the proposed method.