• CN: 11-2187/TH
  • ISSN: 0577-6686

Journal of Mechanical Engineering ›› 2022, Vol. 58 ›› Issue (22): 462-472.doi: 10.3901/JME.2022.22.462

Previous Articles    

Multi-shop Idle Capacity Scheduling Method Based on Genetic Algorithm and Branch and Bound

XIE Zhi-qiang, XIA Ying-chun   

  1. School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080
  • Received:2021-12-12 Revised:2022-05-15 Online:2022-11-20 Published:2023-02-07

Abstract: Personalized products have variable BOM structures and complex processing parameters, making it difficult for a single workshop to meet such a wide range of processing parameters, and requiring cooperation with external workshops to expand capabilities of processing.Since each workshop has different loads and different idle periods, a hybrid scheduling method based on genetic algorithm(GA) and branch and bound(BB) is proposed to improve the utilization of the idle periods. Firstly, a dynamic rescheduling mechanism based on a hybrid optimization strategy is designed to transform the dynamic production process into a series of static scheduling problems that are continuous in time. Then, a constraint programming model with the objective of minimizing the total tardiness is established; Finally, GA and BB method are used to optimize the two phases of the scheduling process, that is, GA is used to generate a pre-scheduling scheme at each event moment, and the scheme is divided into the dispatched part, the to-be-dispatched part and the adjustable part, and the BB method is used to optimize the adjustable part during the execution period of the dispatched part. Google OR-Tools is used to verify the correctness of the proposed model. The simulation experiments show that the hybrid method obtains improvements on each instance compared to the single method, verifying that the proposed method is effective and feasible.

Key words: personalized product, multi-shop, idle capacity, tree constraint, dynamic scheduling

CLC Number: