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

Marwa Bunyan; Hanan  Ali chachan; Zainab  M. Ali

doi:10.47831/mjpas.v3i3.253

Authors

Marwa Bunyan Mustansiriyah university
Prof. Dr. Hanan Ali chachan Department of Mathematics, College of Science, University of Mustansiriyah
Lec.Assist.Zainab M. Ali Department of Water Resources, College of Engineering, University of Baghdad, Baghdad, Iraq

DOI:

https://doi.org/10.47831/mjpas.v3i3.253

Keywords:

Uniform parallel machine, total completion time, total tardiness, total earliness, Dominance properties

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 create the dominance properties are incorporated.