Simultaneous Multi-Skilled Worker Assignment and Mixed-Model Two-Sided Assembly Line Balancing

Abstract:
This paper addresses a multi-objective mathematical model for the mixed-model two-sided assembly line balancing and worker assignment with different skills. In this problem, the operation time of each task is dependent on the skill of the worker. The following objective functions are considered in the mathematical model: (1) minimizing the number of mated-stations (2), minimizing the number of stations, and (3) minimizing the total human cost for a given cycle time. Furthermore, maximizing the weighted line efficiency and minimizing the weighted smoothness are two indices considered simultaneously in this paper. Since this problem is well-known as NP-hard class, a particle swarm optimization (PSO) algorithm is developed to solve it. The performance of the proposed PSO algorithm is evaluated with a simulated annealing (SA) algorithm existed in the literature over several benchmarked test problems for the conditions of the current problem in terms of running time and solution quality. The results show the proposed algorithm is an efficient algorithm .
Language:
English
Published:
International Journal of Engineering, Volume:29 Issue: 2, Feb 2016
Pages:
211 to 221
https://magiran.com/p1506884  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!