带有不确定时间的并行机排序问题

Parallel Machine Scheduling Problem with Uncertain Processing Time

从实际生产应用出发,在并行机排序问题中,加入了不确定变量———不确定加工时间,针对最大完工时间的数学模型,给出了3个不确定数学规划模型,且通过一个数值例子,利用混合智能算法对其中一个模型求解,计算结果表明了模型的合理性及其算法的有效性.

From the practical application of the parallel machine scheduling problems, an uncertainty variable-uncertain processing time is introduced.With regard to the mathematical model of the makespan, three uncertain programming models are given. A numerical example is given and one of the models is solved by the use of hybrid intelligent algorithm. The result shows that the model is reasonable and the algorithm is effective.