论文部分内容阅读
提出了一种基于图的柔性作业车间调度问题(FJSP)的求解方法。通过工序节点集、有向弧集、无向弧集,构建了基于图的FJSP优化模型。应用蚁群算法求解柔性作业车间调度问题,以零件加工时间和弧段中堆积的信息素作为启发式信息,设计蚂蚁在各个节点间的转移概率。以最大完工时间最小化、机床最大负荷最小化、机床负荷均衡化为优化目标,通过加权处理设计了优化目标函数,将多目标优化问题转变为单目标优化问题。通过6X6的实例验证了该算法解决FJSP的可行性和有效性。
A solution to the problem of flexible job shop scheduling based on graph (FJSP) is proposed. Through the process node set, directed arc set and undirected arc set, a graph-based FJSP optimization model is constructed. The ant colony algorithm is used to solve the problem of flexible job shop scheduling. The heuristic information of parts processing time and the pheromone piled up in the arc is used to design the transition probability of ants in each node. In order to minimize the maximum completion time, minimize the maximum load of the machine tool, and balance the machine load as the optimization objective, the optimization objective function is designed by weighted processing, and the multi-objective optimization problem is transformed into the single-objective optimization problem. The example of 6X6 verifies the feasibility and effectiveness of this algorithm to solve FJSP.