TY - GEN
T1 - Job shop scheduling with flexible routings based on analytical target cascading
AU - Li, Yanguang
AU - Zhou, Guanghui
AU - Xiao, Zhongdong
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/7/23
Y1 - 2015/7/23
N2 - For solving the large-scale job shop scheduling problems considering flexible routings with the characteristics of process planning and scheduling optimization, a hierarchical coordination optimization model based on analytical target cascading is proposed in this paper, which is divided into three sub-layers. The process planning layer is for optimal processing routes of all jobs, and multiple manufacturing units is formed by clustering all machines based on factor analysis method in the unit planning layer, and then the optimal scheduling solutions of jobs in each unit is obtained by adopting the improved genetic algorithm respectively in the job scheduling layer, which then gives feedback to the upper layer and repeatedly coordinates to obtain the global optimal solution. Finally, a typical computational experiment comparatively demonstrates the validity of the proposed model and algorithm, showing its efficient advantage in solving the large-scale job shop scheduling problems with flexible routings.
AB - For solving the large-scale job shop scheduling problems considering flexible routings with the characteristics of process planning and scheduling optimization, a hierarchical coordination optimization model based on analytical target cascading is proposed in this paper, which is divided into three sub-layers. The process planning layer is for optimal processing routes of all jobs, and multiple manufacturing units is formed by clustering all machines based on factor analysis method in the unit planning layer, and then the optimal scheduling solutions of jobs in each unit is obtained by adopting the improved genetic algorithm respectively in the job scheduling layer, which then gives feedback to the upper layer and repeatedly coordinates to obtain the global optimal solution. Finally, a typical computational experiment comparatively demonstrates the validity of the proposed model and algorithm, showing its efficient advantage in solving the large-scale job shop scheduling problems with flexible routings.
KW - analytical target cascading
KW - factor analysis
KW - flexible routings
KW - genetic algorithm
KW - job shop scheduling
UR - https://www.scopus.com/pages/publications/84969927087
U2 - 10.1109/ICCAR.2015.7166024
DO - 10.1109/ICCAR.2015.7166024
M3 - 会议稿件
AN - SCOPUS:84969927087
T3 - Proceedings - 2015 International Conference on Control, Automation and Robotics, ICCAR 2015
SP - 168
EP - 172
BT - Proceedings - 2015 International Conference on Control, Automation and Robotics, ICCAR 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - International Conference on Control, Automation and Robotics, ICCAR 2015
Y2 - 20 May 2015 through 22 May 2015
ER -