论文部分内容阅读
针对订单型企业的在线生产调度问题,文章通过统计每个设备上允许插入工序的时间区间,提出了基于最短时间碎片的启发式在线生产调度算法.该算法的主要思路是将工序的先后约束关系和在同一设备上的先后执行关系统一建模为无圈有向图,从而依据最短时间碎片将新订单的调度过程转化为在有向图中添加顶点和有向边的过程.仿真实验结果表明该算法可以在保证订单交付期的前提下实现排产任务,并尽可能少地变更已排产工序在设备上的相对位置;在订单频繁到达时,调度的设备利用率较高,达到了约94%;此外,算法运行较快,适用于较大规模在线生产调度问题的求解.
Aiming at the problem of online production scheduling in order-oriented enterprises, this paper proposes a heuristic on-line production scheduling algorithm based on the shortest time fragmentation by counting the time intervals allowed to insert processes on each device. The main idea of this algorithm is to set the constraints And unified execution on the same device as the non-circle directed graph, which transforms the scheduling of new orders into the process of adding vertices and directed edges in the directed graph according to the shortest time fragmentation.The simulation results show that The algorithm can realize scheduling tasks under the precondition of guaranteeing the delivery of orders and change the relative positions of the scheduled processes on the devices as little as possible. When the orders arrive frequently, the scheduled device utilization rate is higher and reaches about 94%. In addition, the algorithm runs fast and is suitable for solving large-scale online production scheduling problems.