2025 : 4 : 22
parvaneh samouei

parvaneh samouei

Academic rank: Assistant Professor
ORCID:
Education: PhD.
ScopusId: 37124814200
HIndex: 0/00
Faculty: Faculty of Engineering
Address:
Phone:

Research

Title
A Multi-Objective Particle Swarm Optimization for Mixed-Model Assembly Line Balancing with Different Skilled Workers
Type
JournalPaper
Keywords
Mixed-model assembly line balancing; multi-objective optimization; different skilled workers; particle swarm optimization; simulated annealing
Year
2016
Journal Journal of Optimization in Industrial Engineering
DOI
Researchers Parviz Fattahi ، parvaneh samouei

Abstract

This paper presents a multi-objective Particle Swarm Optimization (PSO) algorithm for worker assignment and mixed-model assembly line balancing problem when task times depend on the worker’s skill level. The objectives of this model are minimization of the number of stations (equivalent to the maximization of the weighted line efficiency), minimization of the weighted smoothness index and minimization of the total human cost for a given cycle time. In addition, the performance of proposed algorithm is evaluated against a set of test problems with different sizes. Also, its efficiency is compared with a Simulated Annealing algorithm (SA) in terms of the quality of objective functions. Results show the proposed algorithm performs well, and it can be used as an efficient algorithm. This paper presents a multi-objective Particle Swarm Optimization (PSO) algorithm for worker assignment and mixed-model assembly line balancing problem when task times depend on the worker’s skill level. The objectives of this model are minimization of the number of stations (equivalent to the maximization of the weighted line efficiency), minimization of the weighted smoothness index and minimization of the total human cost for a given cycle time. In addition, the performance of proposed algorithm is evaluated against a set of test problems with different sizes. Also, its efficiency is compared with a Simulated Annealing algorithm (SA) in terms of the quality of objective functions. Results show the proposed algorithm performs well, and it can be used as an efficient algorithm