A Bottleneck Detection Algorithm for Complex Product Assembly Line Based on Maximum Operation Capacity

Dongping Zhao, Xitian Tian and Junhao Geng

Mathematical Problems in Engineering, 2014, vol. 2014, 1-9

Abstract:

Because of the complex constraints in complex product assembly line, existing algorithms not always detect bottleneck correctly and they have a low convergence rate. In order to solve this problem, a hybrid algorithm of adjacency matrix and improved genetic algorithm (GA) was proposed. First, complex assembly network model (CANM) was defined based on operation capacity of each workstation. Second, adjacency matrix was proposed to convert bottleneck detection of complex assembly network (CAN) into a combinatorial optimization problem of max-flow. Third, an improved GA was proposed to solve this max-flow problem by retaining the best chromosome. Finally, the min-cut sets of CAN were obtained after calculation, and bottleneck workstations were detected according to the analysis of min-cut sets. A case study shows that this algorithm can detect bottlenecks correctly and its convergence rate is high.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2014/258173.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2014/258173.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:258173

DOI: 10.1155/2014/258173

Access Statistics for this article

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