Solving a New Multi-objective Unrelated Parallel Machines Scheduling Problem by Hybrid Teaching-learning Based Optimization Article in Press
Author(s):
Abstract:
This paper considers a scheduling problem of a set of independent jobs on unrelated parallel machines (UPMs) that minimizesthe maximum completion time (i.e., makespan or ), maximum earliness ( ), and maximum tardiness ( ) simultaneously. Jobs have non-identical due dates, sequence-dependent setup times and machine-dependentprocessing times. A multi-objective mixed-integer linear programming (MILP) is considered then solved with the ε-constraint method in small-sized problems.The related results are compared with the results obtained by meta-heuristic algorithms.Furthermore, an effectivehybrid multi-objective teachinglearningbased optimization (HMOTLBO) algorithm is proposed, whose performance is compared with a non-dominated sorting genetic algorithm (NSGA-II) fortest problems generated at random. The associated results show that the proposed HMOTLBO outperformsthe NSGA-II in terms of different metrics.
Keywords:
Language:
English
Published:
International Journal of Engineering, Volume:30 Issue: 2, Feb 2017
Pages:
224 to 233
magiran.com/p1657532
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 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!