In this work, the multiobjective job shop scheduling problem is addressed. The objectives under consideration are minimization of makespan and total tardiness. An integration of dispathing rules, Shifting Bottleneck procedure, and multiobjective memetic algorithm is proposed. The proposed approach significantly outperforms pure dispatching rule and rule-encoded memetic algorithm. In comparison with an existing benchmark approach on eight classical job shop problem instances, the proposed approach reports promising results and updates a large portion of the best known Pareto optimal solutions.