Industrial Engineering Journal ›› 2020, Vol. 23 ›› Issue (4): 174-182.doi: 10.3969/j.issn.1007-7375.2020.04.023

• practice & application • Previous Articles    

A Comparative Study of the Algorithm of Assembly Job Shop Lot Streaming Scheduling

ZENG Chuifei, LIU Jianjun, CHEN Qingxin, MAO Ning   

  1. Guangdong CIM Provincial Key Laboratory, Guangdong University of Technology, Guangzhou 510006, China
  • Received:2019-03-11 Published:2020-08-21

Abstract: A batch scheduling model of assembly job shop with minimum makespan is established. The genetic algorithm is used to construct a solution algorithm based on the overall optimization strategy, hierarchical iterative optimization strategy and bilevel evolution strategy. The difference between them is the optimization mechanisms to deal with the batch division problem and the sub-batch scheduling problem. Finally, through the simulation experiment, the solution effect and convergence speed of several kinds of algorithms are compared, and adaptability are also analyzed.

Key words: assembly job shop, lot streaming scheduling, genetic algorithm, simulation technology

CLC Number: