납기지연시간 단축을 위해 AGV 시간을 고려한 작업할당 방법

초록

Customers are generally requiring a variety of products, earlier due date, and lower price. A manufacturing process needs the efficient scheduling to meet those customer's requirements. This study proposes the novel algorithm named MJA(Minimum Job completion time and AGV time) that increases the performance of machines and AGV(Automated Guided Vehicles) in many kinds of job types. MJA optimizes the bottleneck of machines and efficiency of AGV with considering two types of dispatching at the same time. Suggested algorithm was compared with existing heuristic methods by several simulations, it performed better for reducing the time of tardiness.

키워드