Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem. - Danyu Bai; Lixin Tang (COCOA, 2007)

A New Machine Scheduling Problem with Temperature Loss. - Danyu Bai; Lixin Tang; Meng Su (WKDD, 2008)

New heuristics for flow shop problem to minimize makespan. - Danyu Bai; Lixin Tang (J. Oper. Res. Soc., 2010)

Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan. - Danyu Bai; Lixin Tang (Int. J. Syst. Sci., 2011)

An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times. - Zhi-Hai Zhang; Danyu Bai (Appl. Math. Comput., 2014)

On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem. - Danyu Bai; Zhi-Hai Zhang (Int. J. Syst. Sci., 2014)

Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates. - Danyu Bai (Int. J. Syst. Sci., 2015)

Two-Stage Flow-Open Shop Scheduling Problem to Minimize Makespan. - Tao Ren 002; Bingqian Liu; Peng Zhao; Huawei Yuan; Haiyan Li; Danyu Bai (ICIC (1), 2016)

Permutation flowshop group scheduling with position-based learning effect. - Hanzhang Qin; Zhi-Hai Zhang; Danyu Bai (Comput. Ind. Eng., 2016)

Flexible open shop scheduling problem to minimize makespan. - Danyu Bai; Zhi-Hai Zhang; Qiang Zhang (Comput. Oper. Res., 2016)

Permutation flow shop scheduling problem to minimize nonlinear objective function with release dates. - Danyu Bai; Jianheng Liang; Bingqian Liu; Mengqian Tang; Zhi-Hai Zhang (Comput. Ind. Eng., 2017)

Particle-swarm Krill Herd Algorithm. - Gai-Ge Wang; Danyu Bai; Wenyin Gong; Teng Ren; Xiaobo Liu 001; Xuesong Yan 001 (IEEM, 2018)

A two-stage three-machine assembly scheduling flowshop problem with both two-agent and learning phenomenon. - Chin-Chia Wu; Jia-Yang Chen; Win-Chin Lin; Kunjung Lai; Danyu Bai; Sz-Yun Lai (Comput. Ind. Eng., 2019)

Artificial bee colony algorithms for the order scheduling with release dates. - Win-Chin Lin; Jianyou Xu; Danyu Bai; I-Hong Chung; Shang-Chia Liu; Chin-Chia Wu (Soft Comput., 2019)

Effective algorithms for single-machine learning-effect scheduling to minimize completion-time-based criteria with release dates. - Danyu Bai; Hanyu Xue; Ling Wang 001; Chin-Chia Wu; Win-Chin Lin; Danladi H. Abdulkadir (Expert Syst. Appl., 2020)

An imperialist competitive algorithm with memory for distributed unrelated parallel machines scheduling. - Deming Lei; Yue Yuan; Jingcao Cai; Danyu Bai (Int. J. Prod. Res., 2020)

Minimization of maximum lateness in a flowshop learning effect scheduling with release dates. - Danyu Bai; Xiaoyuan Bai; Jie Yang; Xingong Zhang; Tao Ren 002; Chenxi Xie; Bingqian Liu (Comput. Ind. Eng., 2021)

Several variants of simulated annealing hyper-heuristic for a single-machine scheduling with two-scenario-based dependent processing times. - Chin-Chia Wu; Danyu Bai; Juin-Han Chen; Win-Chin Lin; Lining Xing 001; Jia-Cheng Lin; Shuenn-Ren Cheng (Swarm Evol. Comput., 2021)

Competitive bi-agent flowshop scheduling to minimise the weighted combination of makespans. - Danyu Bai; Ali Diabat; Xinyue Wang; Dandan Yang; Yao Fu; Zhi-Hai Zhang; Chin-Chia Wu (Int. J. Prod. Res., 2022)

Blocking flowshop scheduling problems with release dates. - Danyu Bai; Xiaoyuan Bai; Haoran Li; Quan-Ke Pan; Chin-Chia Wu; Liang Gao 001; Meiting Guo; Lin Lin (Swarm Evol. Comput., 2022)

Minimizing the sum of makespan on multi-agent single-machine scheduling with release dates. - Xinyue Wang; Tao Ren 002; Danyu Bai; Chinenye Ezeh; Haodong Zhang; Zhuoran Dong (Swarm Evol. Comput., 2022)

Minimizing the total electricity cost and maximum lateness of the flow shop scheduling problem under time-of-use energy tariffs. - Xinyue Wang; Feng Chu 001; Tao Ren 002; Danyu Bai (ICNSC, 2023)

Scheduling non-permutation flowshop with finite buffers and two competitive agents. - Danyu Bai; Tianyi Liu; Yuchen Zhang; Tao Ren 002; Zhi-Hai Zhang; Zhiqiang Dong (Comput. Ind. Eng., 2023)

Bicriteria single-machine scheduling with multiple job classes and customer orders. - Jatinder N. D. Gupta; Chin-Chia Wu; Win-Chin Lin; Xingong Zhang; Danyu Bai; Bertrand M. T. Lin; Chia-Cheng Liao (Appl. Soft Comput., 2023)

Profit maximization through integrated order acceptance and scheduling: A metaheuristic approach. - Yantong Li; Lianhua Tang; Danyu Bai; Leandro C. Coelho (Appl. Soft Comput., 2024)

Scheduling a multi-agent flow shop with two scenarios and release dates. - Xinyue Wang; Tao Ren 002; Danyu Bai; Feng Chu 001; Yaodong Yu; Fanchun Meng; Chin-Chia Wu (Int. J. Prod. Res., 2024)

Hybrid Flow Shop Scheduling With Learning Effects and Release Dates to Minimize the Makespan. - Xinyue Wang; Tao Ren 002; Danyu Bai; Feng Chu 001; Xinyu Lu; Zedong Weng; Jiang Li; Jie Liang 005 (IEEE Trans. Syst. Man Cybern. Syst., 2024)

Sequencing a tri-criteria multiple job classes and customer orders problem on a single machine by using heuristics and simulated annealing method. - Chin-Chia Wu; Xingong Zhang; Danyu Bai; Ameni Azzouz; Wen-Hsiang Wu; Xin-Rong Chen; Win-Chin Lin (Oper. Res., 2024)

Minimizing linear combination of makespans on bi-agent single processor with periodic unavailable duration. - Danyu Bai; Xiao Shu; Shuzhang Zhao; Zhi-Hai Zhang; Chengbin Chu; Hu Qin (Expert Syst. Appl., 2025)

A reinforcement learning-based approach for solving multi-agent job shop scheduling problem. - Zhuoran Dong; Tao Ren 002; Fang Qi; Jiacheng Weng; Danyu Bai; Jie Yang; Chin-Chia Wu (Int. J. Prod. Res., 2025)

Scheduling a Distributed Permutation Flowshop With Uniform Machines and Release Dates. - Danyu Bai; Tianyi Liu; Yuchen Zhang; Feng Chu 001; Hu Qin; Liang Gao 001; Yue Su; Mingjie Huang (IEEE Trans Autom. Sci. Eng., 2025)

Bi-Objective Optimization of a Flow Shop Scheduling Problem Under Time-of-Use Tariffs. - Xinyue Wang; Feng Chu 001; Tao Ren 002; Danyu Bai (IEEE Trans Autom. Sci. Eng., 2025)