default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBaoyu Liao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Fangjun Zhu, Jun Pei, Baoyu Liao, Ya Zhou, Panos M. Pardalos:
A modified variable neighborhood search algorithm for dynamic lot-sizing with supplier selection under varying delivery time quotation. Comput. Oper. Res. 164: 106532 (2024)- [j10]Baoyu Liao, Shaojun Lu, Tao Jiang, Xing Zhu:
A variable neighborhood search and mixed-integer programming models for a distributed maintenance service network scheduling problem. Int. J. Prod. Res. 62(20): 7466-7485 (2024) - 2023
- [j9]Xing Zhu, Baoyu Liao
:
Optimal investment decision for photovoltaic projects in China: a real options method. J. Comb. Optim. 46(5): 30 (2023) - [c1]Ran Chen, Baoyu Liao:
Application of XR technology in stomatology education: Theoretical basis, application scenarios and future prospects. VR Workshops 2023: 69-73 - 2022
- [j8]Xing Zhu, Baoyu Liao, Shanlin Yang, Panos M. Pardalos:
Evolutionary game analysis on government subsidy policy and bank loan strategy in China's distributed photovoltaic market. Ann. Math. Artif. Intell. 90(7-9): 753-776 (2022) - [j7]Xing Ji, Baoyu Liao, Shanlin Yang:
A variable neighborhood search algorithm for human resource selection and optimization problem in the home appliance manufacturing industry. J. Comb. Optim. 44(1): 223-241 (2022) - 2021
- [j6]Jun Pei, Qingru Song, Baoyu Liao, Xinbao Liu, Panos M. Pardalos:
Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration. Ann. Oper. Res. 298(1): 407-444 (2021) - [j5]Baoyu Liao, Haoxin Wang, Xing Zhu, Shanlin Yang, Panos M. Pardalos:
Improved DE search for competing groups scheduling with deterioration effects. Optim. Lett. 15(2): 469-494 (2021) - 2020
- [j4]Jun Pei, Jinling Wei, Baoyu Liao, Xinbao Liu, Panos M. Pardalos:
Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent. Ann. Oper. Res. 294(1): 191-223 (2020) - [j3]Baoyu Liao, Xingming Wang, Xing Zhu, Shanlin Yang, Panos M. Pardalos:
Less is more approach for competing groups scheduling with different learning effects. J. Comb. Optim. 39(1): 33-54 (2020) - [j2]Baoyu Liao, Qingru Song, Jun Pei, Shanlin Yang, Panos M. Pardalos:
Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration. J. Glob. Optim. 78(4): 717-742 (2020)
2010 – 2019
- 2018
- [j1]Baoyu Liao, Jun Pei, Shanlin Yang, Panos M. Pardalos, Shaojun Lu:
Single-Machine and Parallel-Machine Parallel-Batching Scheduling Considering Deteriorating Jobs, Various Group, and Time-Dependent Setup Time. Informatica 29(2): 281-301 (2018)
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-09-14 23:52 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:
