论文部分内容阅读
针对单工序平行机排序LPT方法计算步骤多等问题,提出了一种适用于中小企业现场排序的最优解下限截取启发式算法。传统平行机排序最优解下限表达式存在因偏离最优解过大而难以引导排序走向最优的缺陷,改进后的下限表达式更加接近于最优解。从计算步骤多少和偏离最优解下限的最大偏差率两个角度,比较分析了最优解下限截取法与LPT法的特点。经实验数据验证,得出零件数与平行机数之比非整除且满足一定条件时,简单易行的截取法更优于LPT法的结论。
Aiming at the problem of multi-step parallel LPT method calculation steps and so on, this paper proposes a heuristic algorithm for the optimal solution lower-bound interception heuristic which is suitable for on-site sequencing of SMEs. The lower limit of the traditional parallel machine ranking optimal solution has the disadvantage that the deviation from the optimal solution is too large to guide the ranking to the optimal. The improved lower bound expression is closer to the optimal solution. The characteristics of LPT method and LPT method are compared and analyzed from two aspects: the number of calculation step and the maximum deviation rate which deviate from the lower limit of the optimal solution. The experimental data show that the ratio of the number of parts to the number of parallel machines is not divisible, and when certain conditions are satisfied, the simple and easy method of interception is better than the conclusion of LPT.