Scheduling Algorithm Using Path Relinking for Production Process with Crane Interference

抄録

In manufacturing industries, customers demand a wide variety of products, with high quality and fast delivery. Production scheduling systems have become critical for efficient operation. However, scheduling problems in manufacturing are generally large and complex with many constraints. It is difficult to create an optimal production schedule that satisfies all constraints within a reasonable timeframe. This study targets a factory with multiple working machines and two overhead cranes. Our research aims to obtain a solution algorithm to avoid interference of overhead cranes and machine competition and a production plan that minimizes the total makespan for each job. As the problem must be solved within a reasonable timeframe, we have developed the solution algorithm using metaheuristics and scheduling simulation. In general, metaheuristic algorithms must strike a balance between an intensive search for good solutions and a search for diverse solutions. Accordingly, we propose a new algorithm using path relinking in a scatter search. This method was demonstrated to be effective in obtaining good solutions with little variation in numerical experiments. In this paper, we describe previous research, our target process, and new solution algorithm and discuss algorithm design methods based on computer experiments.