Multi-objective complex product assembly scheduling problem considering parallel team and worker skills

被引:21
作者
Liu, Ziwen [1 ]
Liu, Jianhua [1 ,2 ]
Zhuang, Cunbo [1 ,2 ]
Wan, Feng [3 ]
机构
[1] Beijing Inst Technol, Sch Mech Engn, Lab Digital Mfg, Beijing 100081, Peoples R China
[2] Beijing Inst Technol, Yangtze Delta Reg Acad, Jiaxing 314000, Peoples R China
[3] Shanghai Inst Spacecraft Equipment, Shanghai 200240, Peoples R China
基金
中国国家自然科学基金;
关键词
Flow shop scheduling problem; Assembly line of complex products; Multiple objective evolutionary algorithm; Multi-skilled and multilevel worker; HYBRID FLOWSHOP; ALGORITHM; OPTIMIZATION; ASSIGNMENT; 2-STAGE; MODEL;
D O I
10.1016/j.jmsy.2022.05.003
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The flow shop scheduling problem (FSP) is a classic shop scheduling problem with a strong engineering background. As an extension of FSP, the hybrid flow shop scheduling problem (HFSP) involves parallel machine scheduling, and the worker assignment problem on assembly lines (WAPAL) involves worker allocation. Parallel machine scheduling and multi-skilled and multilevel worker allocation are both involved in the actual assembly lines of complex products, but few studies have investigated them simultaneously. This work studies a complex product assembly line scheduling problem considering multi-skilled worker assignment and parallel team scheduling and takes the maximum completion time and the imbalance degree of team workload as the optimization objective. An integer programming model is proposed, and a hybrid coding method considers the worker assignment and task order. Three improved strategies based on a multiple objective evolutionary algorithm (MOEA) are proposed in the local search. Finally, 20 test instances are generated based on actual enterprise labor data, and the results based on the three strategies are compared with six MOEAs. The results show that the three strategies are superior in terms of the quality and distribution of solutions. The inverted generational distance (IGD) index value is increased by 49.97%, 47.89%, 47.08% respectively and the hypervolume (HV) index value is increased by 39.76%, 38.19%, 38.15% respectively.
引用
收藏
页码:454 / 470
页数:17
相关论文
共 39 条
[1]   Hybrid approaches to optimize mixed-model assembly lines in low-volume manufacturing [J].
Biele, Alexander ;
Moench, Lars .
JOURNAL OF HEURISTICS, 2018, 24 (01) :49-81
[2]   A survey on human resource allocation problem and its applications [J].
Bouajaja, Sana ;
Dridi, Najoua .
OPERATIONAL RESEARCH, 2017, 17 (02) :339-369
[3]  
Bryan WP, 2019, J MANUF SYST, V50, P180
[4]   Embedding ant system in genetic algorithm for re-entrant hybrid flow shop scheduling problems with time window constraints [J].
Chamnanlor, Chettha ;
Sethanan, Kanchana ;
Gen, Mitsuo ;
Chien, Chen-Fu .
JOURNAL OF INTELLIGENT MANUFACTURING, 2017, 28 (08) :1915-1931
[5]   A Reference Vector Guided Evolutionary Algorithm for Many-Objective Optimization [J].
Cheng, Ran ;
Jin, Yaochu ;
Olhofer, Markus ;
Sendhoff, Bernhard .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2016, 20 (05) :773-791
[6]   Solving the hybrid flow shop scheduling problem with limited human resource constraint [J].
Costa, A. ;
Fernandez-Viagas, V. ;
Framinan, J. M. .
COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 146
[7]   Assembly planning with an ordering genetic algorithm [J].
De Lit, P ;
Latinne, P ;
Rekiek, B ;
Delchambre, A .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2001, 39 (16) :3623-3640
[8]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[9]   An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints [J].
Deb, Kalyanmoy ;
Jain, Himanshu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :577-601
[10]  
Fang P, 2021, IEEE T IND INFORM, V99, P1