Memetic Algorithm for Flexible Job Shop Scheduling with Preemption
Author(s):
Abstract:
Flexible job shop scheduling problem)FJSP(is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. FJSP is NP-hard and mainly presents two difficulties. The first one is to assign each operation to a machine out of a set of capable machines, and the second one deals with sequencing the assigned operations on the machines. However, it is quite difficult to achieve an optimal solution to this problem in medium and large size problems with traditional optimization approaches. In this paper a memetic algorithm (MA) or flexible job shop scheduling with overlapping in operation is proposed that solves the FJSP to minimize makespan time and obtain the optimum solution for small problem and best solution for medium and large scale problems. In this paper we also used preemption to improve the results of memetic algorithm and reduce the makespan.
Keywords:
Language:
Persian
Published:
International Journal of Industrial Engineering & Production Management, Volume:22 Issue: 4, 2012
Page:
331
magiran.com/p984547
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 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!