With the increasing energy price, the rapid growth of electricity demand and severe challenges for sustainable development, energy-efficient scheduling is becoming more and more important for power-intensive manufacturing industry, especially for batch production companies. This paper investigates a bi-objective single machine batch scheduling problem with non-identical job sizes, the time-of-use (TOU) electricity prices, and different energy consumption rates of the machine. The first objective is to minimize the makespan and the second is to minimize the total energy costs, by considering both the machine utilization and the economic cost. The problem is formulated as an integer programming model. Then, an exact ε-constraint method is adapted to obtain the exact Pareto front. To deal with large scale problems, based on decomposition ideas, two heuristic methods are developed to obtain approximate Pareto fronts. Computational experiments on randomly generated instances show the effectiveness of the methods. A study case of a real-world glass manufacturing company is also conducted to show that the proposed methods are promising for practical usages.