Journal of Shanghai University(Natural Science Edition) ›› 2021, Vol. 27 ›› Issue (2): 360-368.doi: 10.12066/j.issn.1007-2861.2165

• Research Articles • Previous Articles     Next Articles

An improved genetic algorithm based mixed-model U-shaped assembly line balancing problem of type-Ⅱ

PENG Yunfang, LIANG Yuzhen, XIA Beixin()   

  1. School of Management, Shanghai University, Shanghai 200444, China
  • Received:2019-04-15 Online:2021-04-30 Published:2021-04-27
  • Contact: XIA Beixin E-mail:bxxia@shu.edu.cn

Abstract:

To solve the type-Ⅱ balancing problem of a mixed-model U-shaped assembly line to minimise the cycle time, a mathematical model was established and an improved genetic algorithm was designed. In the decoding process of the genetic algorithm, three search techniques were used to assign tasks to workstations, and workstation times under these search techniques were compared. The optimal assignment was selected according to the expected cycle time. The task assignment result determined whether to update the value of the expected cycle time automatically. The performance of the proposed improved genetic algorithm was proved by a set of benchmark instances. Finally, a practical balancing problem was analysed and effectively solved by the proposed method.

Key words: mixed-model assembly line balancing, U-shaped assembly line, mixed integer programming, improved genetic algorithm

CLC Number: