Abstract
This work addresses on flexible job shop rescheduling problem with machine recovery. The goal is to minimize the maximum machine workload and instability simultaneously. As an almost parameter-free metaheuristic, Jaya is used and developed to solve it. A local search operator and an initializing rule are developed for improving Jaya's performance. Ten cases from a remanufacturing company are solved to verify the proposed Jaya's performance. The comparisons and discussions show the effectiveness of the proposed Jaya for rescheduling flexible job shop with machine recovery.