黄宇纯, 王树青, 王骥程. Flow-shop调度问题的遗传启发算法[J]. 信息与控制, 1996, 25(4): 212-216.
引用本文: 黄宇纯, 王树青, 王骥程. Flow-shop调度问题的遗传启发算法[J]. 信息与控制, 1996, 25(4): 212-216.
HUANG Yuchun, WANG Shuqing, WANG Jicheng. FLOW-SHOP SCHEDULING PROBLEM BY GENETIC HEURISTIC ALGORITHM[J]. INFORMATION AND CONTROL, 1996, 25(4): 212-216.
Citation: HUANG Yuchun, WANG Shuqing, WANG Jicheng. FLOW-SHOP SCHEDULING PROBLEM BY GENETIC HEURISTIC ALGORITHM[J]. INFORMATION AND CONTROL, 1996, 25(4): 212-216.

Flow-shop调度问题的遗传启发算法

FLOW-SHOP SCHEDULING PROBLEM BY GENETIC HEURISTIC ALGORITHM

  • 摘要: 结合遗传算法和启发式规则,构造了一种新的遗传启发搜索算法,用于求解Flow-shop调度问题.通过分析和实例计算表明,算法能够有效地适用于大规模加工过程中调度问题的优化计算,在运行时间,适应性和最优率等方面都具有很好的搜索优势.

     

    Abstract: A new Genetic Heuristic Algorithm(GHA), combining genetic algorithm with heuristic rules, is presented for solving flow-shop scheduling problem in this paper. On the basis of analysing and calculating of examples, it is proved that the new algorithm is efficient to use for optimization of large-scale products, and it has very capable for searching on calculation time, fitness, and goodness.

     

/

返回文章
返回