Abstract
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 develop the dominance properties are incorporated, is proposed and tested on a large set of randomly generated instances.
Keywords
Dominance properties.
total Completion time
total earliness
total Tardiness
Uniform parallel machine