A Multi-Rule Algorithm for Multi-Shop Integrated Scheduling Problem

Abstract

Aiming at the problems that the existing two-shop integrated scheduling algorithm cannot deal with the case of multiple-shop, and that the existing algorithm is too sensitive to the characteristic of instance to obtain a better solution, a multi-rule algorithm (MRA) is proposed to solve the two issues. MRA firstly uses multi-rule combined sorting strategy to generate a variety of sorting schemes, then schedules the sorting schemes according to the multi-shop tentative strategy, and finally determines the scheduling solution with the shortest completion time as the scheduling result. By analysing the simulation instances, the effectiveness of the MRA algorithm is verified. It can be seen from the simulation results that the MRA algorithm is better than the control algorithm in terms of completion time and calculation time.