Abstract: In this paper,we analyze the scheduling of whole-set orders under flow-shop with service level constraint.Then we present a mathematical model,and also propos three construction heuristics for scheduling and three heuristics for order sets respectively based on constructive method,genetic and simulated annealing algorithm. At the end,some simulations for evaluations are made,and the results show that the genetic algorithm is most effective,but the other two have their own advantages.

Key words: flow-shop, whole-set order, service level, scheduling