An effective structural boundary processing method based on support vector machine for discrete topology optimization. - Sheng Chu; Mi Xiao; Liang Gao 001; Lin Gui 006; Hao Li 017 (CSCWD, 2016)

A new neighborhood structure for job shop scheduling problems. - Jin Xie; Xinyu Li 001; Liang Gao 001; Lin Gui 006 (CoRR, 2021)

A hybrid algorithm with a new neighborhood structure for job shop scheduling problems. - Jin Xie; Xinyu Li 001; Liang Gao 001; Lin Gui 006 (Comput. Ind. Eng., 2022)

Heuristics for Vehicle Routing Problem: A Survey and Recent Advances. - Fei Liu 044; Chengyu Lu; Lin Gui 006; Qingfu Zhang 001; Xialiang Tong; Mingxuan Yuan (CoRR, 2023)

Optimisation framework and method for solving the serial dual-shop collaborative scheduling problem. - Lin Gui 006; Ling Fu; Xinyu Li 001; Wei Zhou; Liang Gao 001; Zhimou Xiang; Wei Zhu (Int. J. Prod. Res., 2023)

A new neighbourhood structure for job shop scheduling problems. - Jin Xie; Xinyu Li 001; Liang Gao 001; Lin Gui 006 (Int. J. Prod. Res., 2023)

Tabu search based on novel neighborhood structures for solving job shop scheduling problem integrating finite transportation resources. - You-Jie Yao 001; Lin Gui 006; Xinyu Li 001; Liang Gao 001 (Robotics Comput. Integr. Manuf., 2024)

A hybrid genetic tabu search algorithm for distributed job-shop scheduling problems. - Jin Xie; Liang Gao 001; Xinyu Li 001; Lin Gui 006 (Swarm Evol. Comput., 2024)

A uniform sampling method for permutation space. - Lin Gui 006; Xinyu Li 001; Qingfu Zhang 001; Liang Gao 001 (Ann. Oper. Res., 2024)

A hybrid optimization algorithm based on fitness landscape analysis for generalized job-shop scheduling problems. - Lin Gui 006; Xinyu Li 001; Liang Gao 001; Qihao Liu (Comput. Ind. Eng., 2025)