Scheduling problems in manufacturing are large and complex, and there are many constraints. Therefore, it is difficult to obtain the optimal solution within a practical time. If it is necessary to avoid interference between cranes in addition to not violating the operational constraints of each machine, it is difficult to obtain the optimal solution to such scheduling problems in a practical time. For this scheduling problem, we propose a new solution algorithm combining scatter search with path relinking and operation simulation. In this paper, we describe previous research, our target process, the new solution algorithm, and discuss algorithm design methods based on numerical experiments.

This content is only available via PDF.
You do not currently have access to this content.