抽象的

Artificial Immune System algorithm for multi objective flow shop scheduling problem

M.Vairamuthu, S.Porselvi, DR.A.N.Balaji, J.Rajesh Babu

The n-job, m-machine flow shop scheduling problem is one of the most general job scheduling problems. This study deals with the multi objective optimization with the criteria of makespan minimization and minimization of total weighted flow time for the flow shop scheduling problem. The n-job mmachine problem is known to be NP hard problem, several meta heuristics have been applied so far in the literature. Artificial Immune Systems (AIS) are new intelligent problem solving techniques that are being used in scheduling problems. AIS can be defined as computational systems inspired by theoretical immunology, observed immune functions, principles and mechanisms in order to solve problems. In this research, a computational method based on clonal selection principle and affinity maturation mechanisms of the immune response is used. Matlab code was generated to use the algorithm for finding the optimal solution