Abstract
This paper consider a single bacth processing machne problem, in this problem, jobs whit release time and size will be assigned into some batches and processed aiming to minimize makespan. give taht this problem in NP-hard, an immunoglobulin-based artifical immune system (IAIS) alogarithm is used to solve the problem . the proposed IAIS alogarithm has two meaningful featurs. first, the searching area is limited in the somatic recombination process in order to decrease the computitational time. second, serveral local search metods area mxed for use in each run to change neighbor and ascape from local optimum. comparisons with an alogarithm for the problem are shown to verify proposed IAIS. comparisons results have shown that the proposed IAIS alogarithm has a better performance than the existing alogarithm.
