TY - JFULL AU - Wahyudin P. Syam and Ibrahim M. Al-Harkan PY - 2010/3/ TI - Comparison of Three Meta Heuristics to Optimize Hybrid Flow Shop Scheduling Problem with Parallel Machines T2 - International Journal of Industrial and Manufacturing Engineering SP - 266 EP - 274 VL - 4 SN - 1307-6892 UR - https://publications.waset.org/pdf/699 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 38, 2010 N2 - This study compares three meta heuristics to minimize makespan (Cmax) for Hybrid Flow Shop (HFS) Scheduling Problem with Parallel Machines. This problem is known to be NP-Hard. This study proposes three algorithms among improvement heuristic searches which are: Genetic Algorithm (GA), Simulated Annealing (SA), and Tabu Search (TS). SA and TS are known as deterministic improvement heuristic search. GA is known as stochastic improvement heuristic search. A comprehensive comparison from these three improvement heuristic searches is presented. The results for the experiments conducted show that TS is effective and efficient to solve HFS scheduling problems. ER -