基于超启发式算法的可重构装配车间调度

The reconfigurable assembly stations, the multi-skill workers and the multiTevel assembly Operations show a strong relationship when dealing with the assembly scheduling problem. In view of the lack of scheduling models that consider the above three key capabilities, a reconfigurable assembly shop scheduling model based on the hyper heuristic algorithm was proposed. The correlation of the reconfiguration switching time, regular/key process requirements and personnel/equipment correction factor were quantitative characterization. By using the hyper heuristic algorithm, the multi-scheduling rule would be fitted and the optimal scheduling scheme was iteratively opti-mized with evolutionary operators. The small/large batch instances and the case study of a satellite assembly Workshop were drop in to verify the effectiveness and efficiency of the hyper heuristic algorithm, by reducing the mean/ maximum value of the makespan, the delay time, the assembly time and reconfiguration time in the scheduling.