default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChou-Jung Hsu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j23]Xingong Zhang, Win-Chin Lin, Chou-Jung Hsu, Chin-Chia Wu
:
Resource constrained scheduling problems with general truncated sum-of-processing time dependent effect under single machine and unrelated parallel machines. Comput. Ind. Eng. 110: 344-352 (2017)- [j22]Chuanli Zhao, Chou-Jung Hsu, Win-Chin Lin, Wen-Hsiang Wu, Chin-Chia Wu:
An Investigation of Single-Machine Due-Window Assignment with Time-Dependent Processing Times and a Controllable Rate-Modifying Activity. Comput. J. 60(9): 1353-1362 (2017) - 2014
- [j21]Chuanli Zhao, Chou-Jung Hsu, Shuenn-Ren Cheng, Yunqiang Yin, Chin-Chia Wu:
Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs. Appl. Math. Comput. 248: 503-510 (2014) - [j20]Suh-Jenq Yang, Chou-Jung Hsu, Dar-Li Yang:
Note on "Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time". Inf. Sci. 260: 215-217 (2014) - [j19]Chou-Jung Hsu, Dar-Li Yang:
Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time. Optim. Lett. 8(2): 519-531 (2014) - 2013
- [j18]Yunqiang Yin, Chin-Chia Wu, Wen-Hsiang Wu, Chou-Jung Hsu, Wen-Hung Wu:
A branch-and-bound procedure for a single-machine earliness scheduling problem with two agents. Appl. Soft Comput. 13(2): 1042-1054 (2013) - [j17]Chou-Jung Hsu, Min Ji, Jia-Yuarn Guo, Dar-Li Yang:
Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities. Inf. Sci. 253: 163-169 (2013) - [j16]Min Ji, Chou-Jung Hsu, Dar-Li Yang:
Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration. J. Comb. Optim. 26(3): 437-447 (2013) - 2012
- [j15]Suh-Jenq Yang, Chou-Jung Hsu, Dar-Li Yang:
Note on "Unrelated parallel-machine scheduling with deteriorating maintenance activities". Comput. Ind. Eng. 62(4): 1141-1143 (2012) - [j14]Dar-Li Yang, T. C. E. Cheng, Suh-Jenq Yang, Chou-Jung Hsu:
Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities. Comput. Oper. Res. 39(7): 1458-1464 (2012) - [j13]Wen-Hung Kuo, Chou-Jung Hsu, Dar-Li Yang:
Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect. Inf. Sci. 184(1): 282-297 (2012) - [j12]Suh-Jenq Yang, Chou-Jung Hsu, Dar-Li Yang:
Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance. Optim. Lett. 6(8): 1855-1873 (2012) - 2011
- [j11]T. C. Edwin Cheng, Chou-Jung Hsu, Dar-Li Yang:
Unrelated parallel-machine scheduling with deteriorating maintenance activities. Comput. Ind. Eng. 60(4): 602-605 (2011) - [j10]Chou-Jung Hsu, Suh-Jenq Yang, Dar-Li Yang:
Two due date assignment problems with position-dependent processing time on a single-machine. Comput. Ind. Eng. 60(4): 796-800 (2011) - [j9]Wen-Hung Kuo, Chou-Jung Hsu, Dar-Li Yang:
Some unrelated parallel machine scheduling problems with past-sequence-dependent setup time and learning effects. Comput. Ind. Eng. 61(1): 179-183 (2011) - [j8]T. C. Edwin Cheng, Chou-Jung Hsu, Yi-Chi Huang, Wen-Chiung Lee:
Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness. Comput. Oper. Res. 38(12): 1760-1765 (2011) - [j7]Chou-Jung Hsu, T. C. Edwin Cheng, Dar-Li Yang:
Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time. Inf. Sci. 181(20): 4799-4803 (2011) - 2010
- [j6]Chou-Jung Hsu, Chinyao Low, Chwen-Tzeng Su:
A single-machine scheduling problem with maintenance activities to minimize makespan. Appl. Math. Comput. 215(11): 3929-3935 (2010) - [j5]Chinyao Low, Chou-Jung Hsu, Chwen-Tzeng Su:
A modified particle swarm optimization algorithm for a single-machine scheduling problem with periodic maintenance. Expert Syst. Appl. 37(9): 6429-6434 (2010)
2000 – 2009
- 2009
- [j4]Wen-Hung Kuo, Chou-Jung Hsu, Dar-Li Yang:
A note on unrelated parallel machine scheduling with time-dependent processing times. J. Oper. Res. Soc. 60(3): 431-434 (2009) - 2008
- [j3]Chinyao Low, Chou-Jung Hsu, Chwen-Tzeng Su:
Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration. Comput. Math. Appl. 56(1): 257-265 (2008) - [j2]Chinyao Low, Chou-Jung Hsu, Chwen-Tzeng Su:
A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines. Comput. Oper. Res. 35(3): 845-853 (2008) - [j1]Dar-Li Yang, Chou-Jung Hsu, Wen-Hung Kuo:
A two-machine flowshop scheduling problem with a separated maintenance constraint. Comput. Oper. Res. 35(3): 876-883 (2008)
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-24 23:19 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:
