An Effective Hybrid Metaheuristic Algorithm for Hybrid flowshop Scheduling Problem

This paper addresses the Hybrid Flow Shop scheduling problem with limited buffer capacities and sequence dependent setup times. Total completion time of all jobs considered as optimization criteria because it s more realistic than makespan and cause more stable and effective use of facilities. We presented two metaheuristic algorithms and an effective hybrid metaheuristic based on Simulated Annealing that embodies Tabu Search for local search. Computational experiments showed that this algorithm is effective in compare pure metaheuristic algorithms.

Keywords:

Hybrid Flow Shop , total completion time , buffer , Sequence Dependent Setup Time , HybridMetaheuristic Algorithm