A Mathematical Model and a Simulated Annealing Algorithm for Balancing Multi-manned Assembly Line Problem with Sequence-Dependent Setup Time

Wucheng Yang and Wenming Cheng

Mathematical Problems in Engineering, 2020, vol. 2020, 1-16

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.

Date: 2020
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2020/8510253.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2020/8510253.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:8510253

DOI: 10.1155/2020/8510253

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().