Abstract
This paper addresses the issue of comparing sixteen heuristics for the flow shop scheduling problem (FSSP) with the objective of minimizing the makespan. Simulations are conducted to compare and evaluate the CPU time and solution quality of these heuristics. The superiority of the heuristic proposed by Nawaz, Enscore, and Ham (NEH) has been numerically confirmed by the experiment we presented. Therefore, heuristic NEH is a good way of generating a near-optimal schedule for the FSSP with minimum makespan criterion.