Abstract
Multi-manned assembly lines are often designed to produce large-sized products, such as automobiles, trucks and buses. In this type of production lines, usually there are multimanned workstations where a group of workers simultaneously performs different operations on the same individual product. One of the problems, that managers of such production lines usually encounter, is to produce the optimal number of items using a fixed number of workstations, without adding new ones in order to meet the market demand. In this paper, such a class of assembly line balancing problems, named multi-manned assembly line balancing problems type II, has been addressed. Since the problem is NP-hard, a meta-heuristic approach based on a simulated annealing algorithm has been developed to solve the problem. The performance of the proposed algorithm has been tested on a set of test problems taken from the literature; the results show that the algorithm performs well.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
