default search action
Wen-Hung Wu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j14]Jeng-Shin Sheu
, Siang-Ru Wu, Wen-Hung Wu:
Performance Improvement on Traditional Chinese Task-Oriented Dialogue Systems With Reinforcement Learning and Regularized Dropout Technique. IEEE Access 11: 19849-19862 (2023)
2010 – 2019
- 2018
- [j13]Xiaoling Cao, Wen-Hsing Wu, Wen-Hung Wu, Chin-Chia Wu
Some two-agent single-machine scheduling problems to minimize minmax and minsum of completion times. Oper. Res. 18(2): 293-314 (2018) - 2017
- [j12]Wen-Hung Wu, Yunqiang Yin, T. C. E. Cheng
A combined approach for two-agent scheduling with sum-of-processing-times-based learning effect. J. Oper. Res. Soc. 68(2): 111-120 (2017) - [j11]Dujuan Wang, Yunqiang Yin, Wen-Hsiang Wu, Wen-Hung Wu, Chin-Chia Wu
A two-agent single-machine scheduling problem to minimize the total cost with release dates. Soft Comput. 21(3): 805-816 (2017) - 2015
- [j10]Yunqiang Yin, Wen-Hung Wu, T. C. E. Cheng
Single-machine scheduling with time-dependent and position-dependent deteriorating jobs. Int. J. Comput. Integr. Manuf. 28(7): 781-790 (2015) - 2014
- [j9]Wen-Hung Wu:
Solving a two-agent single-machine learning scheduling problem. Int. J. Comput. Integr. Manuf. 27(1): 20-35 (2014) - [j8]Yunqiang Yin, Wen-Hung Wu, Wen-Hsiang Wu, Chin-Chia Wu
A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects. Inf. Sci. 256: 91-108 (2014) - [j7]Chin-Chia Wu
A single-machine scheduling with a truncated linear deterioration and ready times. Inf. Sci. 256: 109-125 (2014) - 2013
- [j6]Chin-Chia Wu
The single-machine total tardiness problem with unequal release times and a linear deterioration. Appl. Math. Comput. 219(20): 10401-10415 (2013) - [j5]Chin-Chia Wu
A study of the single-machine two-agent scheduling problem with release times. Appl. Soft Comput. 13(2): 998-1006 (2013) - [j4]Yunqiang Yin, Chin-Chia Wu
A branch-and-bound procedure for a single-machine earliness scheduling problem with two agents. Appl. Soft Comput. 13(2): 1042-1054 (2013) - [j3]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) - 2011
- [j2]T. C. Edwin Cheng
A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations. Comput. Ind. Eng. 60(4): 534-541 (2011)
2000 – 2009
- 2007
- [j1]Wen-Hung Wu, Hui-Ling Lu, Deng-Yuan Huang:
Government expenditure decision-making under fuzzy relations. Int. J. Serv. Stand. 3(3): 289-298 (2007)
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-04-25 05:53 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: