Hybrid Artificial Immune System and Simulated Annealing Algorithms for Solving Hybrid JIT Flow Shop with Parallel Batches and Machine Eligibility

This research deals with a hybrid flow shop scheduling problem with parallel batching, machine eligibility, unrelated parallel machines, and different release dates to minimize the total sum of the weighted earliness and tardiness (et) penalties. in parallel batching situation, it is supposed that a number of machines in some stages are able to perform a certain number of jobs simultaneously. firstly, with respect to the proposed problem, a mixed integer linear programming model is developed. then, since the problem is nphard, for solving large-sized problems, a hybrid meta-heuristic algorithm, which combines artificial immune system and simulated annealing, is proposed. the performance of hybrid algorithm is tested by some numerical experiments, and the results show its superiority to the other two algorithms.