Multi-objective optimization of the U-shaped assembly line ‎balancing and worker assignment considering setup-times ‎and workers' skill

Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
Purpose

In this research due to the importance of the U-shaped assembly line balancing and, on the other hand, the importance of human factors and setup times, we want to develop a bi-objective mathematical model minimize the cycle time and the total cost.

Methodology

Since the research problem is shown to be NP-hard, NSGA-II, which is a population-based algorithm, and also SPEA-II are used to solve the problem.

Findings

A mathematical model for the problem on hand is developed. We solve the problem using NSGA-II and SPEA-II. We use four criteria for analyzing the results of the mathematical model and evaluating the performance of the multi-objective evolutionary algorithms. The experimental results demonstrate that NSGA-II is superior to SPEA-II.

Originality/Value: 

A bi-objective mathematical model for the U-shaped assembly line balancing problem considering setup-times and workers' skill is developed, and the problem is solved using two algorithms.

Language:
Persian
Published:
Journal of Decisions and Operations Research, Volume:8 Issue: 2, 2023
Pages:
283 to 306
magiran.com/p2643790  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!