Industrial Engineering Journal ›› 2020, Vol. 23 ›› Issue (2): 19-25,48.doi: 10.3969/j.issn.1007-7375.2020.02.003

• articles • Previous Articles     Next Articles

An Improved Genetic Algorithm for Flexible Job Shop Scheduling Problem with Multiple Time Constraints

ZHANG Guohui, HU Yifan, SUN Jinghe   

  1. School of Management Engineering, Zhengzhou University of Aeronautics, Zhengzhou 450015, China
  • Received:2019-12-12 Published:2020-04-22

Abstract: The processing time, set-up time and transport time are considered as independent time factors in the flexible job shop scheduling model. A flexible job shop scheduling model considering multiple time constraints is established with the goal of minimum makespan, minimum total set-up time and minimum total transport time. An improved genetic algorithm is proposed to solve the model. By testing the standard data set and comparing with other literature algorithms, the feasibility and effectiveness of the improved genetic algorithm are verified.

Key words: flexible job shop scheduling, genetic algorithm, set-up time, transport time, makespan

CLC Number: