A bi-agent single-processor scheduling to minimize the sum of maximum lateness with release dates.

Danyu Bai

Danyu Bai Ying Li Hanyu Xue Jie Yang Rubing Chen Chin-Chia Wu Hu Qin A bi-agent single-processor scheduling to minimize the sum of maximum lateness with release dates. 2026 April 1049-1067 77 J. Oper. Res. Soc. 4 https://doi.org/10.1080/01605682.2025.2516106 db/journals/jors/jors77.html#BaiLXYCWQ26 streams/journals/jors

Danyu Bai Xiao Shu Shuzhang Zhao Zhi-Hai Zhang Chengbin Chu Hu Qin Minimizing linear combination of makespans on bi-agent single processor with periodic unavailable duration. 127203 2025 287 Expert Syst. Appl. https://doi.org/10.1016/j.eswa.2025.127203 db/journals/eswa/eswa287.html#BaiSZZCQ25 streams/journals/eswa

Zhuoran Dong Tao Ren 0002 Fang Qi Jiacheng Weng Danyu Bai Jie Yang Chin-Chia Wu A reinforcement learning-based approach for solving multi-agent job shop scheduling problem. 3512-3537 2025 63 Int. J. Prod. Res. 10 https://doi.org/10.1080/00207543.2024.2423807 db/journals/ijpr/ijpr63.html#DongRQWBYW25 streams/journals/ijpr

Danyu Bai Wenjia Zheng Chenbo Zang Jie Yang Chin-Chia Wu Hu Qin Discrete optimization algorithms for distributed bi-agent flowshop scheduling with release dates. 102101 2025 98 Swarm Evol. Comput. https://doi.org/10.1016/j.swevo.2025.102101 db/journals/swevo/swevo98.html#BaiZZYWQ25 streams/journals/swevo

Danyu Bai Tianyi Liu Yuchen Zhang Feng Chu 0001 Hu Qin Liang Gao 0001 Yue Su Mingjie Huang Scheduling a Distributed Permutation Flowshop With Uniform Machines and Release Dates. 215-227 2025 22 IEEE Trans Autom. Sci. Eng. https://doi.org/10.1109/TASE.2023.3349167 db/journals/tase/tase22.html#BaiLZCQGSH25 streams/journals/tase

Xinyue Wang Feng Chu 0001 Tao Ren 0002 Danyu Bai Bi-Objective Optimization of a Flow Shop Scheduling Problem Under Time-of-Use Tariffs. 7679-7695 2025 22 IEEE Trans Autom. Sci. Eng. https://doi.org/10.1109/TASE.2024.3468448 db/journals/tase/tase22.html#WangCRB25 streams/journals/tase

Yantong Li Lianhua Tang Danyu Bai Leandro C. Coelho Profit maximization through integrated order acceptance and scheduling: A metaheuristic approach. 111570 2024 159 Appl. Soft Comput. https://doi.org/10.1016/j.asoc.2024.111570 db/journals/asc/asc159.html#LiTBC24

Xinyue Wang Tao Ren 0002 Danyu Bai Feng Chu 0001 Yaodong Yu Fanchun Meng Chin-Chia Wu Scheduling a multi-agent flow shop with two scenarios and release dates. 421-443 2024 January 62 Int. J. Prod. Res. 1-2 https://doi.org/10.1080/00207543.2023.2188646 db/journals/ijpr/ijpr62.html#WangRBCYMW24

Chin-Chia Wu Xingong Zhang Danyu Bai Ameni Azzouz Wen-Hsiang Wu Xin-Rong Chen Win-Chin Lin Sequencing a tri-criteria multiple job classes and customer orders problem on a single machine by using heuristics and simulated annealing method. 2 2024 March 24 Oper. Res. 1 https://doi.org/10.1007/s12351-023-00809-2 db/journals/or/or24.html#WuZBAWCL24

Xinyue Wang Tao Ren 0002 Danyu Bai Feng Chu 0001 Xinyu Lu Zedong Weng Jiang Li Jie Liang 0005 Hybrid Flow Shop Scheduling With Learning Effects and Release Dates to Minimize the Makespan. 365-378 2024 January 54 IEEE Trans. Syst. Man Cybern. Syst. 1 https://doi.org/10.1109/TSMC.2023.3305089 db/journals/tsmc/tsmc54.html#WangRBCLWLL24

Jatinder N. D. Gupta Chin-Chia Wu Win-Chin Lin Xingong Zhang Danyu Bai Bertrand M. T. Lin Chia-Cheng Liao Bicriteria single-machine scheduling with multiple job classes and customer orders. 110809 2023 November 147 Appl. Soft Comput. https://doi.org/10.1016/j.asoc.2023.110809 db/journals/asc/asc147.html#GuptaWLZBLL23

Danyu Bai Tianyi Liu Yuchen Zhang Tao Ren 0002 Zhi-Hai Zhang Zhiqiang Dong Scheduling non-permutation flowshop with finite buffers and two competitive agents. 108939 2023 March 177 Comput. Ind. Eng. https://doi.org/10.1016/j.cie.2022.108939 db/journals/candie/candie177.html#BaiLZRZD23

Xinyue Wang Feng Chu 0001 Tao Ren 0002 Danyu Bai Minimizing the total electricity cost and maximum lateness of the flow shop scheduling problem under time-of-use energy tariffs. 1-6 2023 ICNSC https://doi.org/10.1109/ICNSC58704.2023.10319054 conf/icnsc/2023 db/conf/icnsc/icnsc2023.html#WangCRB23

Danyu Bai Ali Diabat Xinyue Wang Dandan Yang Yao Fu Zhi-Hai Zhang Chin-Chia Wu Competitive bi-agent flowshop scheduling to minimise the weighted combination of makespans. 6750-6771 2022 60 Int. J. Prod. Res. 22 https://doi.org/10.1080/00207543.2021.1923854 db/journals/ijpr/ijpr60.html#BaiDWYFZW22

Xinyue Wang Tao Ren 0002 Danyu Bai Chinenye Ezeh Haodong Zhang Zhuoran Dong Minimizing the sum of makespan on multi-agent single-machine scheduling with release dates. 100996 2022 69 Swarm Evol. Comput. https://doi.org/10.1016/j.swevo.2021.100996 db/journals/swevo/swevo69.html#WangRBEZD22

Danyu Bai Xiaoyuan Bai Haoran Li Quan-Ke Pan Chin-Chia Wu Liang Gao 0001 Meiting Guo Lin Lin Blocking flowshop scheduling problems with release dates. 101140 2022 74 Swarm Evol. Comput. https://doi.org/10.1016/j.swevo.2022.101140 db/journals/swevo/swevo74.html#BaiBLPWGGL22

Danyu Bai Xiaoyuan Bai Jie Yang Xingong Zhang Tao Ren 0002 Chenxi Xie Bingqian Liu Minimization of maximum lateness in a flowshop learning effect scheduling with release dates. 107309 2021 158 Comput. Ind. Eng. https://doi.org/10.1016/j.cie.2021.107309 db/journals/candie/candie158.html#BaiBYZRXL21

Chin-Chia Wu Danyu Bai Juin-Han Chen Win-Chin Lin Lining Xing 0001 Jia-Cheng Lin Shuenn-Ren Cheng Several variants of simulated annealing hyper-heuristic for a single-machine scheduling with two-scenario-based dependent processing times. 100765 2021 60 Swarm Evol. Comput. https://doi.org/10.1016/j.swevo.2020.100765 db/journals/swevo/swevo60.html#WuBCLXLC21

Danyu Bai Hanyu Xue Ling Wang 0001 Chin-Chia Wu Win-Chin Lin Danladi H. Abdulkadir Effective algorithms for single-machine learning-effect scheduling to minimize completion-time-based criteria with release dates. 113445 2020 156 Expert Syst. Appl. https://doi.org/10.1016/j.eswa.2020.113445 db/journals/eswa/eswa156.html#BaiXWWLA20

Deming Lei Yue Yuan Jingcao Cai Danyu Bai An imperialist competitive algorithm with memory for distributed unrelated parallel machines scheduling. 597-614 2020 58 Int. J. Prod. Res. 2 https://doi.org/10.1080/00207543.2019.1598596 db/journals/ijpr/ijpr58.html#LeiYCB20

Chin-Chia Wu Jia-Yang Chen Win-Chin Lin Kunjung Lai Danyu Bai Sz-Yun Lai A two-stage three-machine assembly scheduling flowshop problem with both two-agent and learning phenomenon. 485-499 2019 130 Comput. Ind. Eng. https://doi.org/10.1016/j.cie.2019.02.047 db/journals/candie/candie130.html#WuCLLBL19

Win-Chin Lin Jianyou Xu Danyu Bai I-Hong Chung Shang-Chia Liu Chin-Chia Wu Artificial bee colony algorithms for the order scheduling with release dates. 8677-8688 2019 23 Soft Comput. 18 https://doi.org/10.1007/s00500-018-3466-5 db/journals/soco/soco23.html#LinXBCLW19

Gai-Ge Wang Danyu Bai Wenyin Gong Teng Ren Xiaobo Liu 0001 Xuesong Yan 0001 Particle-swarm Krill Herd Algorithm. 1073-1080 2018 IEEM https://doi.org/10.1109/IEEM.2018.8607812 conf/ieem/2018 db/conf/ieem/ieem2018.html#WangBGR0Y18

Danyu Bai Jianheng Liang Bingqian Liu Mengqian Tang Zhi-Hai Zhang Permutation flow shop scheduling problem to minimize nonlinear objective function with release dates. 336-347 2017 112 Comput. Ind. Eng. https://doi.org/10.1016/j.cie.2017.08.031 db/journals/candie/candie112.html#BaiLLTZ17

Hanzhang Qin Zhi-Hai Zhang Danyu Bai Permutation flowshop group scheduling with position-based learning effect. 1-15 2016 92 Comput. Ind. Eng. https://doi.org/10.1016/j.cie.2015.12.001 db/journals/candie/candie92.html#QinZB16

Danyu Bai Zhi-Hai Zhang Qiang Zhang Flexible open shop scheduling problem to minimize makespan. 207-215 2016 67 Comput. Oper. Res. https://doi.org/10.1016/j.cor.2015.10.012 db/journals/cor/cor67.html#BaiZZ16

Tao Ren 0002 Bingqian Liu Peng Zhao Huawei Yuan Haiyan Li Danyu Bai Two-Stage Flow-Open Shop Scheduling Problem to Minimize Makespan. 527-535 2016 ICIC (1) https://doi.org/10.1007/978-3-319-42291-6_53 conf/icic/2016-1 db/conf/icic/icic2016-1.html#RenLZYLB16

Danyu Bai Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates. 1994-2005 2015 46 Int. J. Syst. Sci. 11 https://doi.org/10.1080/00207721.2013.843736 db/journals/ijsysc/ijsysc46.html#Bai15

Zhi-Hai Zhang Danyu Bai An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times. 238-247 2014 230 Appl. Math. Comput. https://doi.org/10.1016/j.amc.2013.12.127 db/journals/amc/amc230.html#ZhangB14

Danyu Bai Zhi-Hai Zhang On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem. 1657-1667 2014 45 Int. J. Syst. Sci. 8 https://doi.org/10.1080/00207721.2012.748943 db/journals/ijsysc/ijsysc45.html#BaiZ14

Danyu Bai Lixin Tang 0002 Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan. 1143-1153 2011 42 Int. J. Syst. Sci. 7 https://doi.org/10.1080/00207720903308397 db/journals/ijsysc/ijsysc42.html#BaiT11

Danyu Bai Lixin Tang 0002 New heuristics for flow shop problem to minimize makespan. 1032-1040 2010 61 J. Oper. Res. Soc. 6 https://doi.org/10.1057/jors.2009.44 db/journals/jors/jors61.html#BaiT10

Danyu Bai Lixin Tang 0002 Meng Su A New Machine Scheduling Problem with Temperature Loss. 662-666 2008 WKDD https://doi.org/10.1109/WKDD.2008.36 https://doi.ieeecomputersociety.org/10.1109/WKDD.2008.36 conf/wkdd/2008 db/conf/wkdd/wkdd2008.html#BaiTS08 Danyu Bai Lixin Tang Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem. 191-199 2007 conf/cocoa/2007 COCOA https://doi.org/10.1007/978-3-540-73556-4_22 db/conf/cocoa/cocoa2007.html#BaiT07 Danladi H. Abdulkadir Ameni Azzouz Xiaoyuan Bai Jingcao Cai Jia-Yang Chen Juin-Han Chen Rubing Chen Xin-Rong Chen Shuenn-Ren Cheng Chengbin Chu Feng Chu 0001 I-Hong Chung Leandro C. Coelho Ali H. DiabatAli Diabat Zhiqiang Dong Zhuoran Dong Chinenye Ezeh Yao Fu Liang Gao 0001 Wenyin Gong Meiting Guo Jatinder N. D. Gupta Mingjie Huang Kunjung Lai Sz-Yun Lai Deming Lei Haiyan Li Haoran Li Jiang Li Yantong Li Ying Li Jianheng Liang Jie Liang 0005 Chia-Cheng Liao Bertrand M. T. Lin Jia-Cheng Lin Lin Lin Win-Chin Lin Bingqian Liu Shang-Chia Liu Tianyi Liu Xiaobo Liu 0001 Xinyu Lu Fanchun Meng Quan-Ke Pan Fang Qi Hanzhang Qin Hu Qin Tao Ren 0002 Teng Ren Xiao Shu Meng Su Yue Su Lianhua Tang Lixin Tang Lixin Tang 0002 Mengqian Tang Gaige WangGai-Ge Wang Ling Wang 0001 Xinyue Wang Jiacheng Weng Zedong Weng Chin-Chia Wu Wen-Hsiang Wu Chenxi Xie Lining Xing 0001 Jianyou Xu Hanyu Xue Xuesong Yan 0001 Dandan Yang Jie Yang Yaodong Yu Huawei Yuan Yue Yuan Chenbo Zang Haodong Zhang Qiang Zhang Xingong Zhang Yuchen Zhang Zhi-Hai Zhang Peng Zhao Shuzhang Zhao Wenjia Zheng