Matching and same time stop scheduling constraint processing technology based on genetic algorithm

Aiming at the non-independent processes and non-exclusive resources occupation of Job Shop Scheduling Problem (JSSP), the processing technology of matching and same-time-stop scheduling constraints based on improved genetic algorithm was proposed. By analyzing matching, batch processing, process sequence and machine constraints, the target model for utilization rate of batch processing machines and average delay time of task was built. To solve matching and batch processing constraints, a two-dimensional encoding chromosome was designed and the processing procedure of scheduling constraints based on Genetic Algorithm (GA) was presented. To meet scheduling constraints, the adjustment mechanism of blending chromosome meeting dynamic process combination was raised. The same-time-stop constraint within processes was well solved. The engineering example analysis demonstrated the effectiveness of proposed technology.