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 differen t release d tes to mini mize the tot al sum of th e weighted earliness an d tardiness ( ET ) penalt ies. In parallel batching situation, it is suppos ed that a nu mber of ma chines in s ome stages are able to of jo bs simultaneously. F rstly, with a certain number perform ixed inte ger linear pro b lem, a to the prop osed respect programmi g model is developed Then, sin c e the problem is NP- a hybrid meta -heuristic olving lar ge-sized pro blems, hard , for which comb ines artific ial immune system and simulated algorithm, is hybrid al gorithm is propose d. The perf ormance of annealing, its the results show and some numer ical experiments, tested by o the other two algorit hms. superiority

Keywords:

hybrid flow shop , parallel batching , artificial immune system , machine eligibility , earliness and tardiness