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
|
| رابط المحتوى: |
عدد مرات التحميل
16
| المستخلص: |
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. |
|---|---|
| ISSN: |
2518-5845 |
عناصر مشابهة
-
Solve Job Shop Scheduling Problem with Sequence Dependent Setup Times Using a Local Search Algorithm with Different Neighborhood Search Structure
بواسطة: Hamed, Mohammad Mahmoud منشور: (2020) -
Solve No –Wait Job Shop Scheduling Problem Using a Local Search Algorithm
بواسطة: Hamed, Mohammad Mahmoud منشور: (2020) -
Hybrid Cuckoo Search and Simulated Annealing Algorithm for Solving a Job Shop Scheduling Problem
بواسطة: الروسان، محمد هاني منشور: (2020) -
ON MERGING SEQUENCING AND SCHEDULING THEORY WITH GENETIC ALGORITHMS TO SOLVE STOCHASTIC JOB SHOPS
بواسطة: Al Harkan, Ibrahim M. منشور: (1997) -
Sequence Dependent Setup Scheduling of A Single Processor
بواسطة: Mendahawi, Nabeel F. منشور: (2000)
