This paper deals with a scheduling problem in a flow shop process with parallel machines. The objective of this problem is to minimize the makespan, and the problem has complicated constraints. We propose two kinds of genetic algorithm to solve the problem. By examining numerical results, a comparison is made between them from the viewpoint of accuracy.
