A Process Migration Oriented Multi-Shop Integrated Scheduling Algorithm for Double Objectives

Abstract

The characteristic of multi-shop scheduling is that the processing equipment is scattered in multiple workshops in different geographical locations. To solve this problem, a multi-shop comprehensive scheduling algorithm considering migration dual-objective is proposed of migration of a single complex product in multi-shop equipment, and the workpiece is migrated from one device to another during the processing. The algorithm first uses the leaf nodes of the process tree as a set of schedulable operations; second, the pre-scheduled operation set is determined according to the long path first strategy and the short time strategy; third, the actual scheduling set of the same idle equipment is determined according to the same equipment procedure selection strategy in the workshop; finally, considering the migration time and cost of the process to be processed, a two-objective optimization strategy for process shop selection is proposed. The example results show that the algorithm in this paper consumes less time and cost during the migration process, and can obtain a relatively compromised solution of the total time and total cost of product scheduling.