Research on multi-lane selective bank based multi-shop sequencing

This study deal with a kind of sequencing problem in multi-shop production based on multilane selectivity bank. To meet the requirement of overall production optimization, this paper performs rearranging on output sequence of an upper stream workshop by means of a sorting buffer; therefore the changeover work in its downstream workshop can be reduced. After introducing the mathematical model of this problem, an algorithm which combines heuristic and genetic method is developed. The main idea of the proposed algorithm is a combination and nesting strategy. It employs a genetic algorithm to decide which lane the successive product will be stored in, and employs a heuristic algorithm to decide which product in the buffer will be retrieve. For the sake of evaluating the result of this algorithm, an index named Creative Changeover (CC) is proposed. Computing result shows that, relative to the mono-heuristic algorithm, CC index can be reduced about 33% when applying the given algorithm. The model and algorithm is suitable for the multi-shop assembly sequencing of vehicle and other complex product, moreover, it is applied in a manufacturing execution system.