ارسل ملاحظاتك

ارسل ملاحظاتك لنا







Solve job shop scheduling problem with sequence dependent setup time using a simulated annealing algorithm with different neighborhood search search structure

المصدر: المجلة الليبية العالمية
الناشر: جامعة بنغازي - كلية التربية بالمرج
المؤلف الرئيسي: Hamed, Mohammad Mahmoud (Author)
المجلد/العدد: ع7
محكمة: نعم
الدولة: ليبيا
التاريخ الميلادي: 2016
الشهر: مايو
الصفحات: 1 - 17
DOI: 10.37376/1570-000-007-003
ISSN: 2518-5845
رقم MD: 762887
نوع المحتوى: بحوث ومقالات
اللغة: الإنجليزية
قواعد المعلومات: EduSearch
مواضيع:
كلمات المؤلف المفتاحية:
Job shop scheduling | Sequence-dependent setup times | Simulated annealing | neighborhood search
رابط المحتوى:
صورة الغلاف QR قانون

عدد مرات التحميل

16

حفظ في:
LEADER 02746nam a22002297a 4500
001 0142710
024 |3 10.37376/1570-000-007-003 
041 |a eng 
044 |b ليبيا 
100 |a Hamed, Mohammad Mahmoud   |e Author   |9 402183 
245 |a Solve job shop scheduling problem with sequence dependent setup time using a simulated annealing algorithm with different neighborhood search search structure  
260 |b جامعة بنغازي - كلية التربية بالمرج  |c 2016  |g مايو  
300 |a 1 - 17 
336 |a بحوث ومقالات  |b Article 
520 |b This paper examines job shop scheduling problems with sequence dependent setup times under objective function minimization of makespan (JSSP/SDST/Cmax). An effective meta-heuristic, simulated annealing is developed to potentially solve the problem. Simulated annealing is a well-recognized algorithm and historically classified as a localsearch-based meta-heuristic. The performance of the simulated annealing critically depends on its operators and parameters. The proposed algorithm to an effective metaheuristic simulated annealing with novel operators to potentially solve the problem. In this paper, proposed Simulated Annealing an effective neighborhood search structure based on insertion neighborhoods as well as analyzing the behavior of simulated annealing with different types of operators and parameters. The results showed that the proposed Simulated Annealing PSA algorithm gives less makespan value and CPU time with different problem size taken from the OR- library compared to previous well known SA algorithm. It note when changed in some factors with proposed NS the makespan change for the better. In independent setup times it compared the result with the solution from OR- library, have been results indicated the proposed simulated annealing algorithm near from best solution, with medium and large problems, and in small problems given best solution. It can say when the No. of temperatures between T0 and Tf increases with the proposed neighbors will improve the solution, but not continuously.  
653 |a الوظائق   |a التسلسل  |a الخوارزميات  
692 |b Job shop scheduling  |b Sequence-dependent setup times  |b Simulated annealing  |b neighborhood search 
773 |4 العلوم الإنسانية ، متعددة التخصصات  |4 العلوم الاجتماعية ، متعددة التخصصات  |6 Humanities, Multidisciplinary  |6 Social Sciences, Interdisciplinary  |c 003  |e Global Libyan Journal  |f Al-Mağallaẗ al-libiyyaẗ al-ʿalāmiyyaẗ  |l 007  |m ع7  |o 1570  |s المجلة الليبية العالمية  |v 000  |x 2518-5845 
856 |u 1570-000-007-003.pdf 
930 |d y  |p y  |q y 
995 |a EduSearch 
999 |c 762887  |d 762887 

عناصر مشابهة