考虑运输时间的柔性作业车间调度问题研究

Research on the flexible job shop scheduling problem considering transportation time

针对工件实际加工过程中工件转移的重要性,对运输时间的柔性作业车间调度问题进行优化研究,建立了以最小化最大完工时间和总碳排放量为优化目标的调度数学模型,并提出了一种改进的NSGA-Ⅱ算法。算法采用基于工序和机器特征的双链式编码方法,设计了针对工件运输时间的插入式解码操作;为探索到更优的前沿解设计了一种局部邻域搜索策略;基于非支配解引入了节能低碳策略进行排放量调整;通过仿真实验对比结果,表明了改进NSGA-Ⅱ算法及其求解考虑运输时间的柔性作业车间调度问题的有效性。

Given the significance of workpiece transfers in actual machining processes,this study conducts optimization research on the flexible job shop scheduling problem considering transportation time.It establishes a scheduling mathematical model with the objectives of minimizing the maximum completion time and the total carbon emissions.Furthermore,an improved NSGA-II algorithm is proposed.The algorithm utilizes a dual-chain coding method based on operation and machine characteristics,along with an insertion-based decoding operation for workpiece transportation time.Additionally,this research introduces a local neighborhood search strategy to explore better Pareto front solutions and incorporates an energy-saving and low-carbon strategy for emission adjustment based on non⁃dominated solutions.Through comparative simulation experiments,the results demonstrate the effectiveness of the enhanced NSGA-II algorithm in addressing the flexible job shop scheduling problem with transportation time considerations.