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.

中文翻译：

---

一种面向流程迁移的双目标多车间集成调度算法

多车间调度的特点是加工设备分散在不同地理位置的多个车间。针对这一问题，提出了一种考虑迁移双目标的多车间综合调度算法，即多车间设备中单个复杂产品的迁移，加工过程中工件从一台设备迁移到另一台设备。该算法首先使用进程树的叶子节点作为一组可调度的操作；其次，根据长路径优先策略和短时间策略确定预调度操作集；第三，根据车间内相同的设备程序选择策略，确定相同闲置设备的实际调度集；最后，考虑待加工工艺的迁移时间和成本，提出了工艺车间选择的两目标优化策略。算例结果表明，本文算法在迁移过程中消耗的时间和成本较少，可以得到产品调度总时间和总成本相对折中的解。