The heuristic and metahuristic methods to minimize the total completion and total tardiness jobs times problem

	The heuristic and metahuristic methods to minimize the total completion and total tardiness jobs times problem
International Journal of Nonlinear Analysis and Applications
مقاله 162، دوره 13، شماره 2، مهر 2022، صفحه 2025-2035 اصل مقاله (518.21 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22075/ijnaa.2022.6548
نویسندگان
Faez Hassan Ali^* ¹؛ Wadhah Abdulleh Hussein²
¹Department of Mathematics, Faculty of Science, Mustansiriyah University, Baghdad, IRAQ
²Mathematics Department, College of Science, University of Diyala, Iraq
چکیده
In this paper, we found some methods for solving one of the bicriteria machine scheduling problems (BMSP). Our discussed problem is represented by the total completion and the total tardiness jobs times $(1//(\sum C_j,\sum T_j))$ simultaneously. In order to solve the suggested BMSP, some new heuristic and metaheuristic methods are proposed which are produced good results. The results of the new suggested methods are compared with the exact method; like the complete enumeration method (CEM) and Branch and Bound (BAB) method, then compared results of the heuristics with each other's to obtain to the most efficient method.
کلیدواژه‌ها
Branch and Bound method؛ complete enumeration method؛ heuristic؛ metahurisitc
مراجع

آمار تعداد مشاهده مقاله: 45,089 تعداد دریافت فایل اصل مقاله: 50,889

پیوندهای مفید

آمار