Abstract: The job-shop scheduling problem (JSS) is NP-hard. Traditional algorithms have their features and disadvantages. The powerful system processing capabilities of the immune system provide rich metaphors for its artificial counterpart. As a result, immune algorithm has emerged, and gradually been applied to many engineering practices. Due to the stubborn nature of the JSS, a dynamic evaluation based immune algorithm (DEIA) is initially brought forward to solve JSS. The JSS model is set up, and the antibody is constructed. By simulations of FT10×10 benchmark problem and comparisons with other algorithms, the proposed DEIA proves to be efficient in solving JSS.

Key words: (DEIA), Dynamic evaluation based immune algorithm, FT10×10, Job-shop scheduling, Temporary solution group