搬送車間の正面衝突の回避のための数理制約条件の提案

抄録

This study deals with the no-buffer job-shop scheduling problem to avoid head-on collisions on bidirectional path for AGV transport schedules in manufacturing plants. The no-buffer job-shop scheduling problem allows schedules in which the resources processed by two products are swapped, but such schedules cause head-on collisions in the bidirectional path in the AGV transport schedule. The situation of head-on collision is analyzed mathematically, and constraint conditions are clarified to the collisions. The results of numerical simulations are examined to show that the no-buffer job-shop scheduling problem with the proposed constraints can give appropriate schedules for AGVs.