Dominance Rules for Solving Scheduling on Uniform Parallel Machines with Multi Objective Function

The problem of uniform Parallel Machine Scheduling (UPMS) in manufacturing system is considered with utilizing the aims of minimizing total completion time, total tardiness and total earliness. Multi objective functions have been developed to select optimal solution in uniform parallel machine scheduling. In the present study, our focus is on the NP-hard problem for scheduling n jobs on a uniform parallel machine. We create the dominance properties are incorporated.