Abstract
Multi-manned assembly lines have been widely applied to the industrial production, especially for large-sized products such as cars, buses, and trucks, in which more than one operator in the same station simultaneously performs different tasks in parallel. This study deals with a multi-manned assembly line balancing problem by simultaneously considering the forward and backward sequence-dependent setup time (MALBPS). A mixed-integer programming is established to characterize the problem. Besides, a simulated annealing algorithm is also proposed to solve it. To validate the performance of the proposed approaches, a set of benchmark instances are tested and the lower bound of the proposed problem is also given. The results demonstrated that the proposed algorithm is quite effective to solve the problem.
Highlights
As flow-oriented production systems, assembly lines have been widely used in the industrial production of high quantity standardized commodities since Ford developed such a line in 1913
In terms of the mathematical complexity, the simple assembly line balancing problem (SALBP) is strongly NPhard, since it can be subsumed as a special case of the bin packing problem, which was being proved as a NP-hard problem [4]. us, numerous researchers have been devoted to developing various approaches including exact algorithm, heuristics, and metaheuristics to solve the problem [5, 6]
The test instances are solved by using the MIP model. e model is solved by IBM ILOG CPLEX 12.6.3
Summary
As flow-oriented production systems, assembly lines have been widely used in the industrial production of high quantity standardized commodities since Ford developed such a line in 1913. Sahin and Kellegoz [23] considered the resource constraint in the MALBP-C; a MIP model and a particle swarm optimization algorithm were both developed to solve it Despite it being certainly an argument whose setups are ubiquitous to the realistic work environment and cannot be ignored for decision-making [24], most researchers still assumed setups as negligible in the literature. Akpinar et al [34] developed a hybrid ant-colony optimization algorithm for solving the mixed-model ALBPS; Akpinar and Baykasoglu [35, 36] extended this problem by distinguishing the forward and backward setup time (mALBPS). Ozcan and Toklu [37] firstly considered the two-sided assembly line balancing problem with setups (TALBPS) and developed a MIP model and a heuristic approach to solve it.
Sign-in/Register to view highlights & summary 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.
