首页|期刊导航|复杂系统建模与仿真（英文）|Multi-Objective Variable Neighborhood Search Algorithm to Optimize the Multi-Product U-Shaped Disassembly Line Balancing Problem with a Fixed Number of Stations
Multi-Objective Variable Neighborhood Search Algorithm to Optimize the Multi-Product U-Shaped Disassembly Line Balancing Problem with a Fixed Number of StationsOA
Multi-Objective Variable Neighborhood Search Algorithm to Optimize the Multi-Product U-Shaped Disassembly Line Balancing Problem with a Fixed Number of Stations
Xingyu Zhang;Xiuli Wu
School of Mechanical Engineering,University of Science and Technology Beijing,Beijing 100083,ChinaSchool of Mechanical Engineering,University of Science and Technology Beijing,Beijing 100083,China
disassembly line balancing problemmulti-productfixed number of stationsU-shaped disassembly linevariable neighborhood search algorithm
disassembly line balancing problemmulti-productfixed number of stationsU-shaped disassembly linevariable neighborhood search algorithm
《复杂系统建模与仿真（英文）》 2025 (4)
354-369,16
This work was supported by the National Natural Science Foundation of China(No.52175449).
评论