Multiple dispatching rule combination method is applied widely to solve multiple objective scheduling problem in practice for its simplicity. It mostly combines particular dispatching rules with linear manner corresponding to multiple scheduling objectives. However, the effectiveness of this method has limited practical value for several reasons. It takes considerable effort to find the optimal weights of dispatching rules, and there is not guarantee these weights would be the right ones for a new problem with its updated system parameters. In this paper, a new heuristic method based on unified ranking measure of the job priority is proposed to deal multiple objective scheduling problem. The priority of jobs regarding to respective dispatching rules are calculated and the unified priority of the job priority is calculated by using analytic hierarchical process with adjusted weights corresponding to scheduling objectives. The simulation result demonstrates that the proposed heuristics is feasible and flexible method to solve multiple objective scheduling problem. The sensitivity analysis indicates how throughput and job weight impact on system effectiveness.