从实际应用出发,在成套订单数最大的并行机排序问题中,加入了不确定量——不确定加工时间,并建立了此问题的三个不确定数学规划模型,并利用一套混合智能算法,通过一个算例对这类排序问题进行了说明,计算结果表明了模型的合理性及其算法的有效性.%From the practical application of the parallel machine scheduling problem with complete Order the largest number, the amount of uncertainty - uncertain processing time is introduced and three uncertainty models of the problem are established in the article. A numerical example is given and the model is solved by the use of Hybrid Intelligent Algorithm. The result shows that the model is reasonable and the algorithm is effective.
展开▼
