A Hybrid Genetic Algorithm and Parallel Variable Neighborhood Search for Jobshop Scheduling With an Assembly Stage
Author(s):
Abstract:
In this research a jobshop scheduling problem with an assembly stage is studied. The objective function is to find a schedule which minimizes completion time for all products. At first, a linear model is introduced to express the problem. Then, in order to confirm the accuracy of the model and to explore the efficiency of the algorithms, the model is solved by GAMS. Since the job shop scheduling problem with an assembly stage is considered as a NP-hard problem, a hybrid algorithm is used to solve the problem in medium to large sizes in reasonable amount of time. This algorithm is based on genetic algorithm and parallel variable neighborhood search. The results of the proposed algorithm are compared with the result of genetic algorithm. Computational results showed that for small problems, both HGAPVNS and GA have approximately the same performance. And in medium to large problems HGAPVNS outperforms GA.
Keywords:
Language:
English
Published:
International Journal of Industrial Engineering and Productional Research, Volume:30 Issue: 1, Mar 2019
Pages:
25 to 37
magiran.com/p1968559
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 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!