A Hierarchical method to solve one machine multicriteria sequencing problem

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 independent tasks (jobs) must planned. It is always available starting at time zero and can only do the mono task (job) at a time period. Processing for the task (job) j (j = 1, 2, ..., nj) is necessary meantime the allotted positive implementation time $p_{tj}$ . For the problem of three criteria maximization earliness, a total of square completion times, and total lateness in a hierarchy instance, the access of limitation that which is the desired sequence is held out. The Generalized Least Deviation Method (GLDM) and a robust technique for analyzing historical data to project future trends are analyzed.