Solving a multicriteria problem in a hierarchical method

	Solving a multicriteria problem in a hierarchical method
International Journal of Nonlinear Analysis and Applications
مقاله 218، دوره 13، شماره 1، خرداد 2022، صفحه 2671-2674 اصل مقاله (338.07 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22075/ijnaa.2022.5989
نویسنده
Adawiya A. Mahmood Al-Nuaimi^*
Mathematics Department, College of Science, Diyala University, Diyala, Iraq
چکیده
The problem of minimizing a function of three criteria maximum earliness, the sum of completion times and maximum lateness in a hierarchical method is presented in this paper. A set of n independent jobs has to be scheduled on a single machine that is continuously available from time zero onwards and that can handle no more than one job at a time. Job $ j (j=1,2, \ldots,n) $ requires processing during a given positive uninterrupted time $ p_j $. An algorithm to find the best possible solution is proposed for the problem of three criteria maximum earliness, the sum of completion times and maximum lateness in a hierarchical case.
کلیدواژه‌ها
Single machine؛ Hierarchical؛ Lexicographical؛ Multicriteria scheduling
مراجع

آمار تعداد مشاهده مقاله: 16,180 تعداد دریافت فایل اصل مقاله: 9,785

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

آمار