default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDanyu Bai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Yantong Li, Lianhua Tang
, Danyu Bai, Leandro C. Coelho:
Profit maximization through integrated order acceptance and scheduling: A metaheuristic approach. Appl. Soft Comput. 159: 111570 (2024)- [j21]Xinyue Wang, Tao Ren, Danyu Bai, Feng Chu, Yaodong Yu, Fanchun Meng, Chin-Chia Wu:
Scheduling a multi-agent flow shop with two scenarios and release dates. Int. J. Prod. Res. 62(1-2): 421-443 (2024) - [j20]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. Oper. Res. 24(1): 2 (2024) - [j19]Xinyue Wang, Tao Ren, Danyu Bai, Feng Chu, Xinyu Lu, Zedong Weng, Jiang Li, Jie Liang:
Hybrid Flow Shop Scheduling With Learning Effects and Release Dates to Minimize the Makespan. IEEE Trans. Syst. Man Cybern. Syst. 54(1): 365-378 (2024) - 2023
- [j18]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. Appl. Soft Comput. 147: 110809 (2023) - [j17]Danyu Bai, Tianyi Liu, Yuchen Zhang, Tao Ren, Zhi-Hai Zhang, Zhiqiang Dong:
Scheduling non-permutation flowshop with finite buffers and two competitive agents. Comput. Ind. Eng. 177: 108939 (2023) - [c5]Xinyue Wang, Feng Chu, Tao Ren, Danyu Bai:
Minimizing the total electricity cost and maximum lateness of the flow shop scheduling problem under time-of-use energy tariffs. ICNSC 2023: 1-6 - 2022
- [j16]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. Int. J. Prod. Res. 60(22): 6750-6771 (2022) - [j15]Xinyue Wang, Tao Ren, Danyu Bai, Chinenye Ezeh, Haodong Zhang, Zhuoran Dong:
Minimizing the sum of makespan on multi-agent single-machine scheduling with release dates. Swarm Evol. Comput. 69: 100996 (2022) - [j14]Danyu Bai, Xiaoyuan Bai, Haoran Li, Quan-Ke Pan, Chin-Chia Wu, Liang Gao, Meiting Guo, Lin Lin:
Blocking flowshop scheduling problems with release dates. Swarm Evol. Comput. 74: 101140 (2022) - 2021
- [j13]Danyu Bai, Xiaoyuan Bai, Jie Yang, Xingong Zhang, Tao Ren, Chenxi Xie, Bingqian Liu:
Minimization of maximum lateness in a flowshop learning effect scheduling with release dates. Comput. Ind. Eng. 158: 107309 (2021) - [j12]Chin-Chia Wu, Danyu Bai, Juin-Han Chen, Win-Chin Lin, Lining Xing, 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. Swarm Evol. Comput. 60: 100765 (2021) - 2020
- [j11]Danyu Bai, Hanyu Xue, Ling Wang, 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. Expert Syst. Appl. 156: 113445 (2020) - [j10]Deming Lei, Yue Yuan, Jingcao Cai, Danyu Bai:
An imperialist competitive algorithm with memory for distributed unrelated parallel machines scheduling. Int. J. Prod. Res. 58(2): 597-614 (2020)
2010 – 2019
- 2019
- [j9]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. Comput. Ind. Eng. 130: 485-499 (2019) - [j8]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. Soft Comput. 23(18): 8677-8688 (2019) - 2018
- [c4]Gai-Ge Wang, Danyu Bai, Wenyin Gong, Teng Ren, Xiaobo Liu, Xuesong Yan:
Particle-swarm Krill Herd Algorithm. IEEM 2018: 1073-1080 - 2017
- [j7]Danyu Bai, Jianheng Liang, Bingqian Liu, Mengqian Tang, Zhi-Hai Zhang:
Permutation flow shop scheduling problem to minimize nonlinear objective function with release dates. Comput. Ind. Eng. 112: 336-347 (2017) - 2016
- [j6]Hanzhang Qin, Zhi-Hai Zhang, Danyu Bai:
Permutation flowshop group scheduling with position-based learning effect. Comput. Ind. Eng. 92: 1-15 (2016) - [j5]Danyu Bai, Zhi-Hai Zhang, Qiang Zhang:
Flexible open shop scheduling problem to minimize makespan. Comput. Oper. Res. 67: 207-215 (2016) - [c3]Tao Ren, Bingqian Liu, Peng Zhao, Huawei Yuan, Haiyan Li, Danyu Bai:
Two-Stage Flow-Open Shop Scheduling Problem to Minimize Makespan. ICIC (1) 2016: 527-535 - 2015
- [j4]Danyu Bai:
Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates. Int. J. Syst. Sci. 46(11): 1994-2005 (2015) - 2014
- [j3]Zhi-Hai Zhang, Danyu Bai:
An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times. Appl. Math. Comput. 230: 238-247 (2014) - [j2]Danyu Bai, Zhi-Hai Zhang:
On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem. Int. J. Syst. Sci. 45(8): 1657-1667 (2014) - 2011
- [j1]Danyu Bai, Lixin Tang:
Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan. Int. J. Syst. Sci. 42(7): 1143-1153 (2011)
2000 – 2009
- 2008
- [c2]Danyu Bai, Lixin Tang, Meng Su:
A New Machine Scheduling Problem with Temperature Loss. WKDD 2008: 662-666 - 2007
- [c1]Danyu Bai, Lixin Tang:
Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem. COCOA 2007: 191-199
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-03 00:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
