Providing a Harmony Search Algorithm for Solving Multi Objective Job Shop Scheduling Problem with Considering an Assembly Stage and Lot Streaming
Author(s):
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
In this research a multi-objective job shop scheduling problem with an assembly stage and lot streaming is studied. Lot streaming (LS) technique is a process in which a job (lot) is splitted into smaller jobs (sub-lots) such that successive operations can be overlapped. The aim of this study is to schedule and sequence operations in order to meet constraints and minimize the makespan and total weighted earliness and tardiness penalties which, in turn, leads to decrease time and costs and achieve more effective management in industrial departments. First, a mixed integer linear programming model is presented. Since this problem is classified as NP-hard, a metaheuristic algorithm based on Harmony Search is proposed to solve the problem. In order to verify the effectiveness of the proposed algorithm, several performance measures are used. Computational results revealed that the proposed algorithm outperforms non-dominated sorting Genetic algorithm.
Keywords:
Language:
Persian
Published:
Journal of Industrial Management Perspective, Volume:9 Issue: 1, 2019
Pages:
61 to 86
magiran.com/p2011991
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 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!