Scheduling batch processing machine problem with non-identical job sizes via artificial immune system

This paper considers a single batch processing machine problem, in this problem, jobs with release time and size will be assigned into some batches and processed aiming to minimize makespan. Given that this problem is NP-hard, an immunoglobulin-based artificial immune system (IAIS) algorithm is used to solve the problem. The proposed IAIS algorithm has two meaningful features. First, the searching area is limited in the somatic recombination process in order to decrease the computational time. Second, several local search methods are mixed for use in each run to change neighbor and escape from local optimum. Comparisons with an algorithm for the problem are shown to verify proposed IAIS. Comparisons results have shown that the proposed IAIS algorithm has a better performance than the existing algorithm.