تعداد نشریات | 418 |
تعداد شمارهها | 10,005 |
تعداد مقالات | 83,629 |
تعداد مشاهده مقاله | 78,550,174 |
تعداد دریافت فایل اصل مقاله | 55,691,644 |
Solving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm | ||
Journal of Modern Processes in Manufacturing and Production | ||
مقاله 5، دوره 7، شماره 2، مرداد 2018، صفحه 65-77 اصل مقاله (133.97 K) | ||
نوع مقاله: Research Paper | ||
نویسندگان | ||
Sara Habibi* 1؛ Shahin Ordikhani2؛ Ahmad Reza Haghighi3 | ||
1School of Engineering, Urmia University, Oroumieh, West Azerbaijan Province, Oroumieh, Iran | ||
2Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran | ||
3Technical and Vocational University, Tehran, Tehran Province, Iran | ||
چکیده | ||
In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own processing sequence with the constraint that no waiting time is allowed among operations within any jobs. This study develops a bottleneck-based heuristic (BBFFL) to solve a flexible flowshop problem including a bottleneck stage. Also, a genetic algorithm (GA) based on heuristics for the problem is presented. First, the mathematical model for the problem is proposed, and then the suggested algorithms are explained. For small-scale, the results of the BBFFL and GA are compared to the results derived from the GAMS. For large-scale problems, the results of the GA and BBFFL are compared with each other. For small-scale problems, the algorithms have a close performance but the BBFFL is likely to generate much better in finding solutions in large-scale problems. | ||
کلیدواژهها | ||
Flexible Flowshop؛ No-wait؛ Re-entrant؛ Bottleneck؛ Genetic Algorithm | ||
آمار تعداد مشاهده مقاله: 382 تعداد دریافت فایل اصل مقاله: 276 |