A Bottleneck Detection Algorithm for Complex Product Assembly Line Based on Maximum Operation Capacity. (19th May 2014)

• Record Type: Journal Article
• Authors: Zhao, Dongping; Tian, Xitian; Geng, Junhao
• Other Names: Raghavan Balaji Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2014(2014)
• Publication Date: 2014-05-19
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2014/258173
• Languages: English
• ISSNs: 1024-123X

Abstract

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.