High-speed production scheduling method based on analysis of blocking-time for lot production in distributed flow-shop line

In order to improve productivity in lot production in distributed flow-shop lines, it is necessary to schedule the allocation of lots to sublines so as to level the load between sublines and input order of sublines so as to reduce the blocking-time in each subline. In addition, in actual scheduling work, high-speed scheduling is required. However, IGA, which is the conventional high-speed scheduling method, has limited the ability to search for the input order, and it has been difficult to schedule the input order with high productivity in large-scale problems. Therefore, we make it possible to perform high-speed search for a highly productive input order by 3-opt method based on the analysis of blocking-time. As a result of the evaluation, it was confirmed that it is possible to make a schedule that is faster and more efficient than the conventional IGA method.