The multi-objective scheduling problem for the multi-product batch process with no-wait constraint is considered with makespan and total flow time minimizations, and a multi-objective discrete group search optimizer is proposed. The algorithm employs a well-known heuristic to generate initial solutions, and updates a non-dominated solution set by operators of producers, scroungers and rangers.Besides, an insertion-based local search procedure is hybridized. A bunch of computational experiments reveal that the proposed algorithm yields a non-dominated solution set with better IGD and Set Coverage values than the non-dominated sorting genetic algorithm and the bi-objective multi-start simulated annealing algorithm. It is also shown that, the algorithm can provide better basis for multi-objective decision-makers, which benefits the operation optimization of batch process production.