Abstract. The problem of minimizing a function of three criteria maximum earliness, total of square completion times and total lateness in a hierarchical (lexicographical) method is proposed in this article. On one machine, n independently tasks (jobs) must planned. It is always available starting at time zero and can only do mono task (job) at time period. Processing for task (job) j(j = 1, 2, ..., nj) is necessary meantime the allotted positively implementation time ptj . For the problem of three criteria maximization earliness, total of square completion times, and total lateness in a hierarchy instance, the access of limitation that which is desired sequence is hold out. The Generalized Least Deviation Method (GLDM), a robust technique for analyzing historical data to project future trends is analyzed.
Al-Nuaimi, A. A. M. (2024). A HIERARCHICAL METHOD TO SOLVE ONE MACHINE MULTICRITERIA SEQUENCING PROBLEM. Computational Methods for Differential Equations, (), -. doi: 10.22034/cmde.2024.61553.2667
MLA
Adawiya A. Mahmood Al-Nuaimi. "A HIERARCHICAL METHOD TO SOLVE ONE MACHINE MULTICRITERIA SEQUENCING PROBLEM". Computational Methods for Differential Equations, , , 2024, -. doi: 10.22034/cmde.2024.61553.2667
HARVARD
Al-Nuaimi, A. A. M. (2024). 'A HIERARCHICAL METHOD TO SOLVE ONE MACHINE MULTICRITERIA SEQUENCING PROBLEM', Computational Methods for Differential Equations, (), pp. -. doi: 10.22034/cmde.2024.61553.2667
VANCOUVER
Al-Nuaimi, A. A. M. A HIERARCHICAL METHOD TO SOLVE ONE MACHINE MULTICRITERIA SEQUENCING PROBLEM. Computational Methods for Differential Equations, 2024; (): -. doi: 10.22034/cmde.2024.61553.2667
)