Machine scheduling problems (MSP) are     considered as one of the most important classes of combinatorial optimization problems. In this paper, the problem of job scheduling on a single machine is studied to minimize the multiobjective and multiobjective objective function. This objective function is: total completion time, total lead time and maximum tardiness time, respectively, which are formulated as  are formulated. In this study, a mathematical model is created to solve the research problem. This problem can be divided into several sub-problems and simple algorithms have been found to find the solutions to these sub-problems and compare them with efficient solutions. For this problem, some rules that provide efficient solutions have been proved and some special cases have been introduced and proved since the problem is an NP-hard problem to find some efficient solutions that are efficient for the discussed problem 1// and good or optimal solutions for the multi-objective functions 1// ,, and emphasize the importance of the dominance rule (DR), which can be applied to this problem to improve efficient solutions.