Volume 31, Issue 2 (IJIEPR 2020)                   IJIEPR 2020, 31(2): 189-202 | Back to browse issues page

XML Print

1- Department of Industrial Engineering, Faculty of Engineering Management, Kermanshah University of Technology, Kermanshah, Iran , a.roshani@kut.ac.ir
2- Department of Mechanical, Energy, Management, and Transportation Engineering (DIME), University of Genova, Genova, Italy.
Abstract:   (3089 Views)
Multi-manned assembly line balancing problems (MALBPs) can be usually found in plants producing large-sized high-volume products such as automobiles and trucks. In this paper, a cost-oriented version of MALBPs, namely, CMALBP, is addressed. This class of problems may arise in final assembly lines of products in which the manufacturing process is very labor-intensive. Since CMALBP is NP-Hard, a heuristic approach based on a tabu search algorithm is developed to solve the problem. The proposed algorithm uses two neighborhood generation mechanisms, namely swap and mutation, that effectively collaborate with each other to build new feasible solutions; moreover, two separate tabu lists (associated with the two generation mechanisms) are used to check if moving to a new generated neighbor solution is forbidden or allowed. To examine the efficiency of the proposed algorithm, some experimental instances are collected from the literature and solved. The obtained results show the effectiveness of the proposed tabu search approach.
Full-Text [PDF 741 kb]   (1782 Downloads)    
Type of Study: Research | Subject: Optimization Techniques
Received: 2020/04/15 | Accepted: 2020/04/18 | Published: 2020/06/27

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.