Abstract: This paper considers the scheduling problem of a flow shop with multiple processor satoneor more stages(FSMP). The objective is tominimize the total earliness and tar diness costs of jobs. This is an NP-hard problem. We present amodel of FSMP and construct a genetic assigning heuristic algorithm. Finally,experiment results are shown.