JIT (Just In Time) is one of the important procedure in scheduling problem. This procedure follow to minimize earliness and tardiness both together. This problem is a multi objective scheduling problem. One of the solving method for this problem is finding the Pareto-optima. This research deals with the single machine scheduling problem where three objects number of tardy job, maximum earliness and maximum tardiness must be minimized . The branch and bound approach is proposed to find all the Pareto- optima. In this research several new dominance properties, upper bound and lower bound rules achived that the branch and bound procedure performed efficiently. We generate 700 randomly problems to test this approach. Computational results are reported for instances up to 25 jobs in size.
