آمار
| تعداد نشریات | 44 |
| تعداد شمارهها | 1,303 |
| تعداد مقالات | 16,020 |
| تعداد مشاهده مقاله | 52,489,954 |
| تعداد دریافت فایل اصل مقاله | 15,217,490 |
A Hierarchical method to solve one machine multicriteria sequencing problem | ||
| Computational Methods for Differential Equations | ||
| مقاله 24، دوره 13، شماره 1، فروردین 2025، صفحه 327-338 اصل مقاله (350.81 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22034/cmde.2024.61553.2667 | ||
| نویسنده | ||
| Adawiya A. Mahmood Al-Nuaimi* | ||
| Department of Mathematics, College of Science, University of Diyala, Iraq. | ||
| چکیده | ||
| 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. | ||
| کلیدواژهها | ||
| Sequencing with one machine؛ Hierarchical؛ Lexicographic format؛ Square completion times؛ Multicriteria | ||
|
آمار تعداد مشاهده مقاله: 175 تعداد دریافت فایل اصل مقاله: 117 |
||