این سایت در حال حاضر پشتیبانی نمی شود و امکان دارد داده های نشریات بروز نباشند
Journal of Industrial Engineering and Management Studies، جلد ۱۰، شماره ۱، صفحات ۱۶-۳۳
عنوان فارسی
چکیده فارسی مقاله
کلیدواژه‌های فارسی مقاله
عنوان انگلیسی Flexible flow shop scheduling with forward and reverse flow under uncertainty using the red deer algorithm
چکیده انگلیسی مقاله This paper discusses the modeling and solution of a flexible flow shop scheduling problem with forward and reverse flow (FFSP-FR). The purpose of presenting this mathematical model is to achieve a suitable solution to reduce the completion time (Cmax) in forward flow (such as assembling parts to deliver jobs to the customer) and reverse flow (such as disassembling parts to reproduce parts). Other important decisions taken in this model are the optimal assignment of jobs to each machine in the forward and reverse flow and the sequence of processing jobs by each machine. Due to the uncertainty of the important parameters of the problem, the Fuzzy Jiménez method has been used. The results of the analysis with CPLEX solver show that with the increase in the uncertainty rate, due to the increase in the processing time, the Cmax in the forward and reverse flow has increased. GA, ICA and RDA algorithms have been used in the analysis of numerical examples with a larger size due to the inability of the CPLEX solver. These algorithms are highly efficient in achieving near-optimal solutions in a shorter time. Therefore, a suitable initial solution has been designed to solve the problem and the findings show that the ICA with an average of 273.37 has the best performance in achieving the near-optimal solution and the RDA with an average of 31.098 has performed the best in solving the problem. Also, the results of the T-Test statistical test with a confidence level of 95% show that there is no significant difference between the averages of the objective function index and the calculation time. As a result, the algorithms were prioritized using the TOPSIS method and the results showed that the RDA is the most efficient solution algorithm with a utility weight of 0.9959, and the GA and ICA are in the next ranks. Based on the findings, it can be said that industrial managers who have assembly and disassembly departments at the same time in their units can use the results of this research to minimize the maximum delivery time due to the reduction of costs and energy consumption, even though there are conditions of uncertainty
کلیدواژه‌های انگلیسی مقاله flexible flow shop scheduling problem,forward and reverse flow,Red Deer algorithm,fuzzy Jiménez
نویسندگان مقاله Alireza Aliahmadi |
Iran University of Science & Technology (IUST), Tehran, Iran.

Javid Gharemani-Nahr |
Academic Center for Education, Culture and Research (ACECR), Tabriz, Iran.

Hamed Nozari |
School of Industrial Engineering, Iran University of Science and Technology (IUST), Tehran, Iran.

نشانی اینترنتی https://jiems.icms.ac.ir/article_166508_08d087ba9e3e3d1a0936ff407f457513.pdf
فایل مقاله فایلی برای مقاله ذخیره نشده است
کد مقاله (doi)
زبان مقاله منتشر شده en
موضوعات مقاله منتشر شده
نوع مقاله منتشر شده
برگشت به: صفحه اول پایگاه   |   نسخه مرتبط   |   نشریه مرتبط   |   فهرست نشریات