I N V E S T I G A T I N G T H E R O B U S T N E S S O F H E U R I S T I C A N D M E T A H E U R I S T I C A L G O R I T H M S F O R S T O C H A S T I C B L O C K I N G F L O W S H O P
Author(s):
Abstract:
Production sequencing and scheduling can be considered as an effective tool in optimally utilizing the resources. In the researches the production environment is normally considered as deterministic. In deterministic environment parameters of problem is predefined and fixed while Such an assumption is not true in a real life manufacturing firms. uncertain events make the processing time of jobs uncertain, which may disturb the completion time of jobs and produce makespan variations. These make span variations cause the jobs to accomplish after the expected completion time. Therefore, the researches on deterministic environment are not practically used and uncertainties need consideration in permutation flowshop scheduling. Therefore it is highly important to take the robustness of the schedules into consideration. In most of the studies, robustness measure used is to minimize the variations of a performance indicator in a schedule. These robust scheduling does not assure that the performance indicator will not exceed a certain limit when uncertain events occur. On the other side in the classical flow shop problem is assumed that intermediate buffers have infinite capacity and a job can be stored for unlimited amount of time. In practice, there are many production factories, in which the buffer capacity has to be taken into account, and there may be limits on the capacity of buffers so we consider blocking flow shop problem with beta Robustness of Make span performance measure.The performance of a number of heuristic and meta heuristic algorithms to solve a blocking flow shop is studied in 9 problems in different sizes. The results reveal the robustness of the proposed algorithms and the most robust algorithm in each size is identified. Generally we can say the Asynchronous genetic local search algorithm give better and more robust sequences with respect to other algorithms. It is followed by proposing potential areas for further researches.
Language:
Persian
Published:
Industrial Engineering & Management Sharif, Volume:30 Issue: 2, 2015
Pages:
101 to 109
magiran.com/p1411557
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 1,390,000ريال میتوانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
- حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران میشود.
- پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانههای چاپی و دیجیتال را به کاربر نمیدهد.
In order to view content subscription is required
Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!