Two evolutionary approaches are proposed for order acceptance and scheduling problem. First approach is based on steady-state genetic algorithm. Second approach is based on evolutionary algorithm with guided mutation. Our approaches are compared with two state-of-the-art approaches. Computational results show the effectiveness of our approaches.