S.M Mousavi - Department of Technical and Engineering, Faculty of Industrial Engineering, Islamic Azad University, Noshahr Branch, Iran

This paper considers the problem of scheduling n independent jobs in hybrid flow shop environment. Also, we note that the setup time of a job is required when a switch between two different jobs occurs. The problem is to determine a schedule that minimizes a convex combination of makespan and the total tardiness. For the optimization problem, we develop a meta-heuristic procedure based on hybrid the simulated annealing, genetic algorithm and local search so-calledHSA-GA-LS to solve it approximately. The performance of the proposed algorithm is compared with a genetic algorithm proposed in the literature on a set of test problems. Several computational tests are used to evaluate the effectiveness and efficiency of the proposed algorithm in finding goodquality schedule. From the results obtained, it can be seen that the proposed method is efficient and effective.

Hybrid flow shop; Makespan; Total tardiness; Simulated algorithm; Genetic algorithm