International Journal of Engineering، جلد ۲۸، شماره ۶، صفحات ۹۰۳-۹۱۲

عنوان فارسی
چکیده فارسی مقاله
کلیدواژه‌های فارسی مقاله

عنوان انگلیسی Solving Re-entrant No-wait Flow Shop Scheduling Problem
چکیده انگلیسی مقاله 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 at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of 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 of both of these environments, which is applied in many industries such as robotic industries, is not investigated 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 that solve the problem. Finally, the efficiency of the proposed methods is numerically analyzed.
کلیدواژه‌های انگلیسی مقاله

نویسندگان مقاله M.R. Amin Naseri |
Department of Industrial Engineering, Tarbiat Modares University

Saeed Tasouji Hassanpour |
Industral Engineering, Tarbiat Modares University of Tehran

N. Nahavandi |
School of Industrial and Systems Engineering, Tarbiat Modares University,Tehran, Iran


نشانی اینترنتی http://www.ije.ir/article_72531_7e0bc7b18ba0bae4d0a22a5ebc365372.pdf
فایل مقاله اشکال در دسترسی به فایل - ./files/site1/rds_journals/409/article-409-2062507.pdf
کد مقاله (doi)
زبان مقاله منتشر شده en
موضوعات مقاله منتشر شده
نوع مقاله منتشر شده
برگشت به: صفحه اول پایگاه   |   نسخه مرتبط   |   نشریه مرتبط   |   فهرست نشریات