An Improved Genetic Algorithm with Local Search for Solving the DJSSP with New Dynamic Events

This paper addresses an improved Genetic Algorithm (GA) combined with local search technique to solve the dynamic job shop scheduling problem (DJSSP) with new job arrivals and change in processing time. The objective function is the minimization of the makespan known to be one of the performance criterion used to optimize manufacturing system requirements. To enhance the scheduling process, a rescheduling strategy is used to solve dynamic disturbances. Various problems including the number of jobs, the number of machines and the number of new job arrivals are compared with a collection of state of the art Dispatching Rules(DRs) and other metrics. Obtained results are satisfactory for rescheduling of new job arrivals, change in processing time and makespan minimization.