Abstract: This paper deals with the order planning of single machine with multi-product classes and sequence-independent setup times, and proposes a mixed integer-programming model to minimize the sum of earliness/tardiness penalties of orders. It presents a pseudo-polynomial algorithm based on the filtered beam search by discussing the NP-hardness and the necessary condition of adjacent groups in an optimal sequence. The computational complexity analysis and simulation resuits have confirmed the effectiveness of the algorithm.