Multi-shift planning scheduling method based on improved variable neighborhood genetic algorithm

The invention discloses a multi-shift planning scheduling method based on an improved variable neighborhood genetic algorithm, and the method comprises the steps: assessing the priority according to whether the sum of the importance degree of customers, the order value, the processing time length and the remaining processable time is an emergency single comprehensive index, and taking a productiontask with the higher priority as a priority scheduling of a production task to be scheduled. Compared with the prior art, the method has the advantages that the priority production of emergency orderand short delivery date production tasks is guaranteed, the convergence speed and the quality of solution are improved, the full utilization of bottleneck equipment resources is guaranteed, and bottleneck front equipment can be orderly produced according to the processing sequence of bottleneck procedures. 本发明公开了种基于改进的变邻域遗传算法的多班制计划排程法，通过顾客重要程度、订单价值、加工时长与剩余可加工时间之比和是否为紧急单综合指标评定优先级，优先级较高的生产任务作为待排程生产任务优先排程。与现有技术相比，本发明保证了紧急单和近