Decentralized Job Shop Scheduling by Recursive Propagation Method
Decentralized Job Shop Scheduling by Recursive Propagation Method
复制标题
递归传播法分散作业车间调度
DOI：
10.1299/jsmec.45.551
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
T. Moriwaki
中科院分区：
文献类型：
--
作者：
R. Hino;T. Moriwaki
为了解决分散制造系统中的车间调度问题，提出了一种新的信息交换方法-递归传播法。每台机器只需将其计划的更改通知给直接受更改影响的其他机器。计划变化的影响直接反馈给通知变化的机器。通过机器间简单的一对一通信将计划的变化通知给所有相关机器，并通过相同的通信路径将其行动所造成的影响报告给发起者，将该方法应用于20×10的作业车间调度问题，并通过仿真验证了该方法的可行性.
A new information exchange method named recursive propagation is proposed in order to solve job shop scheduling problems in decentralized manufacturing systems. Each machine only has to notify the change of its plan to other machines which are directly influenced by the change. The effect of the change in the plan is directly fed back to the machine which notified the change. The change in the plan is notified to all the machines concerned by simple one-to-one communication among the machines, and the influence of the change caused by its action can be reported to the initiator through the same communication path. The proposed method is applied to a 20×10 job shop scheduling problem, and the feasibility of this approach is verified by simulations.