![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Jianyou Xu
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Jianyou Xu, Win-Chin Lin, Kai-Xiang Hu, Yu-Wei Chang, Wen-Hsiang Wu, Peng-Hsiang Hsu, Tsung-Hsien Wu, Chin-Chia Wu:
A bi-criterion sequence-dependent scheduling problem with order deliveries. PeerJ Comput. Sci. 10: e1763 (2024) - 2022
- [j8]Chin-Chia Wu, Win-Chin Lin, Ameni Azzouz, Jianyou Xu, Yen-Lin Chiu, Yung-Wei Tsai, Pengyi Shen:
A bicriterion single-machine scheduling problem with step-improving processing times. Comput. Ind. Eng. 171: 108469 (2022)
2010 – 2019
- 2019
- [j7]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) - 2017
- [j6]Jianyou Xu, Chin-Chia Wu
, Yunqiang Yin, Win-Chin Lin:
An iterated local search for the multi-objective permutation flowshop scheduling problem with sequence-dependent setup times. Appl. Soft Comput. 52: 39-47 (2017) - 2016
- [j5]Jianyou Xu, Chin-Chia Wu
, Yunqiang Yin, Chuanli Zhao, Yi-Tang Chiou, Win-Chin Lin:
An order scheduling problem with position-based learning effect. Comput. Oper. Res. 74: 175-186 (2016) - [j4]Jianyou Xu, Win-Chin Lin, Junjie Wu, Shuenn-Ren Cheng, Zi-Ling Wang, Chin-Chia Wu
:
Heuristic based genetic algorithms for the re-entrant total completion time flowshop scheduling with learning consideration. Int. J. Comput. Intell. Syst. 9(6): 1082-1100 (2016) - 2014
- [j3]Jianyou Xu, Yunqiang Yin, T. C. E. Cheng
, Chin-Chia Wu
, Shusheng Gu:
A memetic algorithm for the re-entrant permutation flowshop scheduling problem to minimize the makespan. Appl. Soft Comput. 24: 277-283 (2014) - [j2]Chin-Chia Wu
, Wen-Hsiang Wu, Wen-Hung Wu, Peng-Hsiang Hsu, Yunqiang Yin, Jianyou Xu:
A single-machine scheduling with a truncated linear deterioration and ready times. Inf. Sci. 256: 109-125 (2014) - 2013
- [j1]Wen-Hsiang Wu, Jianyou Xu, Wen-Hung Wu, Yunqiang Yin, I-Fan Cheng, Chin-Chia Wu
:
A tabu method for a two-agent single-machine scheduling with deterioration jobs. Comput. Oper. Res. 40(8): 2116-2127 (2013)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 23:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint