A Solution of a Modified Flowshop Scheduling Problem by Using Genetic Algorithm
Hitoshi IIMA, Nobuo SANNOMIYA
This paper deals with an optimal production ordering problem for a modified flow-shop manufacturing process having two machines and a carrier. The carrier carries a product between machines and yards. Through the motion of the carrier, the succeeding part (Machine 2) gives an influence on the preceding part (Machine 1). This leads to a complicated constraint of the problem. Further, the objective function is defined for evaluating a constant rate of production as well as the total processing time. For obtaining a good suboptimal solution, the genetic algorithm is applied to this problem. A procedure for carrying out the operations of reproduction, crossover and mutation is shown. In particular, a desirable combination of individual description and crossover operation is found out for this problem.