آمار
| تعداد نشریات | 43 |
| تعداد شماره‌ها | 1,275 |
| تعداد مقالات | 15,744 |
| تعداد مشاهده مقاله | 51,862,815 |
| تعداد دریافت فایل اصل مقاله | 14,688,267 |
A HIERARCHICAL METHOD TO SOLVE ONE MACHINE MULTICRITERIA SEQUENCING PROBLEM | ||
| Computational Methods for Differential Equations | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 15 مرداد 1403 اصل مقاله (339.55 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. | ||
| چکیده | ||
| 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. | ||
| کلیدواژه‌ها | ||
| Sequencing with one machine؛ hierarchical؛ lexicographic format؛ square completion times؛ multicriteria | ||
|
آمار تعداد مشاهده مقاله: 160 تعداد دریافت فایل اصل مقاله: 86 |
||