Discrete Jaya algorithm for solving flexible job shop rescheduling problem

Abstract

Rescheduling is a necessary procedure when new jobs come and are inserted into existing schedule in remanufacturing. The stability is an important metrics to evaluate the quality of rescheduling solution. This paper proposed a novel discrete Jaya algorithm to solve flexible job shop rescheduling problem with five objectives, including Makespan, total flow time, maximum machine workload, total machine workload, and stability metrics. The purpose is to analyze the influence or conflict between rescheduling stability and other objectives. Experiments are executed on a large scale remanufacturing case. When the stability metric is optimized, the convergence history of other objectives are recorded. The convergence curves of stability metric are counted when the four objectives are optimized individually. The results and discussions show that the stability metrics is conflict or conflict to a certain extent with other objectives.