Application of artificial immune system algorithm to minimize total holding cost of completed and In-Process products subjectwith no tardy jobs

The most important target in scheduling is meeting the due dates for each job that has been associated with customer. This paper deals with the job-shop scheduling problem (JSP) of minimizing the total holding cost of completed and in-process products subject to no tardy jobs with Artificial Immune System (AIS) Algorithm. Several benchmark problems with different sizes which are commonly used for jobshop scheduling problems of minimizing the makespan are solved by the proposed two non traditional optimization techniques and the results are reported. AIS Algorithm gives better results compared with literature results in terms of total holding cost and computational time.