|
|
International Journal of Engineering، جلد ۳۰، شماره ۲، صفحات ۲۶۱-۲۶۹
|
|
|
| عنوان فارسی |
|
|
| چکیده فارسی مقاله |
|
|
| کلیدواژه‌های فارسی مقاله |
|
|
| عنوان انگلیسی |
Critical Path Method for Flexible Job Shop Scheduling Problem with Preemption |
|
| چکیده انگلیسی مقاله |
This paper addressed a Flexible Job shop Scheduling Problem (FJSP) with the objective of minimization of maximum completion time (Cmax) which job splitting or lot streaming is allowed. Lot streaming is an important technique that has been used widely to reduce completion time of a production system. Due to the complexity of the problem; exact optimization techniques such as branch and bound algorithm will lose their efficiency at medium and large dimensions. Thus, metaheuristic techniques are good options in order to obtain high quality solutions within a reasonable computational time. In this study, firstly, the considered problems are solved in both permitted and not permitted of lot streaming by means of memetic algorithm and then the obtained solutions will be improved by using the critical path method heuristic. The numerical results indicate the high efficiency of the memetic algorithm in comparison with the previous methods; in addition, adding preemption and using allowable idle machines have led to a considerable improvement in the objective function. |
|
| کلیدواژه‌های انگلیسی مقاله |
|
|
| نویسندگان مقاله |
Babak Yousefi Yegane |
, Islamic Azad University, Malayer Branch, Malayer,
Narges Khanlarzade |
Industrial Engineering, Tarbiat Modares University
Isa Nakhai Kamalabadi |
Industrial Engineering, University of Kurdistan
|
|
| نشانی اینترنتی |
http://www.ije.ir/article_72884_ca3686222f82eafd22caf938d8073671.pdf |
| فایل مقاله |
اشکال در دسترسی به فایل - ./files/site1/rds_journals/409/article-409-2062155.pdf |
| کد مقاله (doi) |
|
| زبان مقاله منتشر شده |
en |
| موضوعات مقاله منتشر شده |
|
| نوع مقاله منتشر شده |
|
|
|
|
برگشت به:
صفحه اول پایگاه |
نسخه مرتبط |
نشریه مرتبط |
فهرست نشریات
|