ABSTRAK
To minimize makespan in the permutation flow shop scheduling problem, a modified immunogulobulin-based artificial immune system algorithm (M-IAIS) is developed to search for a job sequence. The basic structure of immunoglobulin-based artificial immune system algorithm consists of three parts, somatic recombination, hypermutation, and isotype switching. A special process, named B cell repertoire updating, is considered in M-IAIS algorithm to accelerate the deviation, hypothesis test, convergence speed. Taillard's benchmark problems are chosen as test instances. Percentage paper to evaluate the performance of M-IAIS algorithm. Computational result show that M-IAIS algorithm is competitive for the permutation flow shop scheduling problem.