Novel heuristic approach for solving multi-objective scheduling problems
المؤلفون المشاركون
Ramadan, Ayad Muhammad
Amin, Bigard A.
المصدر
Ibn al-Haitham Journal for Pure and Applied Science
العدد
المجلد 34، العدد 3 (30 سبتمبر/أيلول 2021)، ص ص. 50-59، 10ص.
الناشر
جامعة بغداد كلية التربية ابن الهيثم
تاريخ النشر
2021-09-30
دولة النشر
العراق
عدد الصفحات
10
التخصصات الرئيسية
الموضوعات
الملخص EN
In this paper, we studied the scheduling of n jobs on a single machine.
Each of n jobs is to be processed without interruption and becomes available for processing at time zero.
The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness.
This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system.
Our lower bound depended on the decomposition of the problem into two subprograms.
We presented a novel heuristic approach to find a near-optimal solution for the problem.
This approach depends on finding efficient solutions for two problems.
The first problem is minimizing total completion time and maximum tardiness.
The second is minimizing total completion time and maximum earliness.
We used these efficient solutions to find a near-optimal solution for another problem which is a sum of maximum earliness and maximum tardiness.
This means we eliminate the total completion time from the two problems.
The algorithm was tested on a set of problems of different n.
Computational results demonstrate the efficiency of the proposed In this paper, we studied the scheduling of n jobs on a single machine.
Each of n jobs is to be processed without interruption and becomes available for processing at time zero.
The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness.
This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system.
Our lower bound depended on the decomposition of the problem into two subprograms.
We presented a novel heuristic approach to find a near-optimal solution for the problem.
This approach depends on finding efficient solutions for two problems.
The first problem is minimizing total completion time and maximum tardiness.
The second is minimizing total completion time and maximum earliness.
We used these efficient solutions to find a near-optimal solution for another problem which is a sum of maximum earliness and maximum tardiness.
This means we eliminate the total completion time from the two problems.
The algorithm was tested on a set of problems of different n.
Computational results demonstrate the efficiency of the proposed method.
نمط استشهاد جمعية علماء النفس الأمريكية (APA)
Amin, Bigard A.& Ramadan, Ayad Muhammad. 2021. Novel heuristic approach for solving multi-objective scheduling problems. Ibn al-Haitham Journal for Pure and Applied Science،Vol. 34, no. 3, pp.50-59.
https://search.emarefa.net/detail/BIM-1255654
نمط استشهاد الجمعية الأمريكية للغات الحديثة (MLA)
Amin, Bigard A.& Ramadan, Ayad Muhammad. Novel heuristic approach for solving multi-objective scheduling problems. Ibn al-Haitham Journal for Pure and Applied Science Vol. 34, no. 3 (2021), pp.50-59.
https://search.emarefa.net/detail/BIM-1255654
نمط استشهاد الجمعية الطبية الأمريكية (AMA)
Amin, Bigard A.& Ramadan, Ayad Muhammad. Novel heuristic approach for solving multi-objective scheduling problems. Ibn al-Haitham Journal for Pure and Applied Science. 2021. Vol. 34, no. 3, pp.50-59.
https://search.emarefa.net/detail/BIM-1255654
نوع البيانات
مقالات
لغة النص
الإنجليزية
الملاحظات
Includes bibliographical references : p. 58-59
رقم السجل
BIM-1255654
قاعدة معامل التأثير والاستشهادات المرجعية العربي "ارسيف Arcif"
أضخم قاعدة بيانات عربية للاستشهادات المرجعية للمجلات العلمية المحكمة الصادرة في العالم العربي
تقوم هذه الخدمة بالتحقق من التشابه أو الانتحال في الأبحاث والمقالات العلمية والأطروحات الجامعية والكتب والأبحاث باللغة العربية، وتحديد درجة التشابه أو أصالة الأعمال البحثية وحماية ملكيتها الفكرية. تعرف اكثر