Solving Re-entrant No-wait Flowshop Scheduling Problem
محل انتشار: ماهنامه بین المللی مهندسی، دوره: 28، شماره: 6
سال انتشار: 1394
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 489
فایل این مقاله در 10 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
این مقاله در بخشهای موضوعی زیر دسته بندی شده است:
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJE-28-6_011
تاریخ نمایه سازی: 15 آذر 1394
چکیده مقاله:
In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit atleast one of the machines more than once. In a no-wait flowshop scheduling problem, when the processof a specific job begins on the first machine, it should constantly be processed without waiting in the line of any machine until its processing is completed on the last one. Integration of the properties ofboth of these environments, which is applied in many industries such as robotic industries, is notinvestigated separately. First, we develop a mathematical model for the problem and then we present three methods to solve it. Therefore, we construct simulated annealing (SA), genetic algorithm (GA)and a bottleneck based heuristic (BB) algorithms to solve the problem. Finally, the efficiency of the proposed methods is numerically analyzed
کلیدواژه ها:
نویسندگان
s Tasouji Hassanpour
Department of Industrial Engineering, Tarbiat Modares University, Iran
m.r Amin-Naseri
Department of Industrial Engineering, Tarbiat Modares University, Iran
n Nahavandi
Department of Industrial Engineering, Tarbiat Modares University, Iran