![](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
Peng-Hsiang Hsu
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
- [j11]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) - 2020
- [j10]Ameni Azzouz
, Po-An Pan, Peng-Hsiang Hsu, Win-Chin Lin, Shang-Chia Liu, Lamjed Ben Said
, Chin-Chia Wu:
A two-stage three-machine assembly scheduling problem with a truncation position-based learning effect. Soft Comput. 24(14): 10515-10533 (2020)
2010 – 2019
- 2018
- [j9]Ting-Peng Liang, Chia-Yin Lai, Peng-Hsiang Hsu, Chao-Min Chiu, Chang-Tseh Hsieh:
Factors affecting satisfaction and brand loyalty to smartphone systems: a perceived benefits perspective. Int. J. Mob. Commun. 16(5): 513-534 (2018) - 2017
- [j8]Dujuan Wang, Yunqiang Yin, Wen-Hsiang Wu, Wen-Hung Wu, Chin-Chia Wu
, Peng-Hsiang Hsu:
A two-agent single-machine scheduling problem to minimize the total cost with release dates. Soft Comput. 21(3): 805-816 (2017) - [j7]Dujuan Wang, Chao-Chung Kang, Yau-Ren Shiau, Chin-Chia Wu
, Peng-Hsiang Hsu:
A two-agent single-machine scheduling problem with late work criteria. Soft Comput. 21(8): 2015-2033 (2017) - 2014
- [j6]Wen-Hsiang Wu, Yunqiang Yin, Shuenn-Ren Cheng, Peng-Hsiang Hsu, Chin-Chia Wu
:
Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration. Asia Pac. J. Oper. Res. 31(6) (2014) - [j5]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) - 2012
- [j4]Der-Chiang Li
, Peng-Hsiang Hsu:
Solving a two-agent single-machine scheduling problem considering learning effect. Comput. Oper. Res. 39(7): 1644-1651 (2012) - 2011
- [j3]T. C. Edwin Cheng
, Shuenn-Ren Cheng, Wen-Hung Wu, Peng-Hsiang Hsu, Chin-Chia Wu
:
A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations. Comput. Ind. Eng. 60(4): 534-541 (2011) - [j2]Der-Chiang Li
, Peng-Hsiang Hsu, Chin-Chia Wu
, T. C. Edwin Cheng
:
Two-machine flowshop scheduling with truncated learning to minimize the total completion time. Comput. Ind. Eng. 61(3): 655-662 (2011) - [j1]Chin-Chia Wu
, Peng-Hsiang Hsu, Juei-Chao Chen, Nae-Sheng Wang:
Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times. Comput. Oper. Res. 38(7): 1025-1034 (2011)
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:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint