default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChing-Jong Liao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j39]Tsui-Ping Chung, Heng Sun, Ching-Jong Liao:
Two new approaches for a two-stage hybrid flowshop problem with a single batch processing machine under waiting time constraint. Comput. Ind. Eng. 113: 859-870 (2017)- 2016
- [j38]Kuo-Jui Wu
, Ching-Jong Liao, Ming-Lang Tseng, Kevin Kuan-Shun Chiu:
Multi-attribute approach to sustainable supply chain management under uncertainty. Ind. Manag. Data Syst. 116(4): 777-800 (2016) - 2015
- [j37]Ching-Jong Liao, Cheng-Hsiung Lee, Hong-Chieh Lee:
An efficient heuristic for a two-stage assembly scheduling problem with batch setup times to minimize makespan. Comput. Ind. Eng. 88: 317-325 (2015) - 2014
- [j36]T. Warren Liao, Pei-Chann Chang, R. J. Kuo, Ching-Jong Liao:
A comparison of five hybrid metaheuristic algorithms for unrelated parallel-machine scheduling and inbound trucks sequencing in multi-door cross docking systems. Appl. Soft Comput. 21: 180-193 (2014) - [j35]Cheng-Hsiung Lee, Ching-Jong Liao, Chien-Wen Chao:
Unrelated parallel machine scheduling with dedicated machines and common deadline. Comput. Ind. Eng. 74: 161-168 (2014) - 2013
- [j34]Tsui-Ping Chung, Ching-Jong Liao:
An immunoglobulin-based artificial immune system for solving the hybrid flow shop problem. Appl. Soft Comput. 13(8): 3729-3736 (2013) - 2012
- [j33]Ching-Jong Liao, Evi Tjandradjaja, Tsui-Ping Chung:
An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem. Appl. Soft Comput. 12(6): 1755-1764 (2012) - [j32]Chien-Wen Chao, Ching-Jong Liao:
A discrete electromagnetism-like mechanism for single machine total weighted tardiness problem with sequence-dependent setup times. Appl. Soft Comput. 12(9): 3079-3087 (2012) - [j31]Cheng-Hsiung Lee, Ching-Jong Liao, Chien-Wen Chao:
Scheduling with multi-attribute setup times. Comput. Ind. Eng. 63(2): 494-502 (2012) - [j30]Ching-Jong Liao, Chien-Wen Chao, Liang-Chuan Chen:
An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times. Comput. Math. Appl. 63(1): 110-117 (2012) - [j29]Ching-Jong Liao, Hsin-Hui Tsou, Kuo-Ling Huang:
Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups. Theor. Comput. Sci. 434: 45-52 (2012) - 2011
- [j28]Ching-Jong Liao, Yu-Lun Tsai, Chien-Wen Chao:
An ant colony optimization algorithm for setup coordination in a two-stage production system. Appl. Soft Comput. 11(8): 4521-4529 (2011) - 2010
- [j27]Ching-Jong Liao, Yaoming Lin, Stephen C. Shih:
Vehicle routing with cross-docking in the supply chain. Expert Syst. Appl. 37(10): 6868-6873 (2010)
2000 – 2009
- 2009
- [j26]Chao-Tang Tseng, Ching-Jong Liao, Kuo-Ling Huang:
Minimizing total tardiness on a single machine with controllable processing times. Comput. Oper. Res. 36(6): 1852-1858 (2009) - [j25]Ching-Jong Liao, Chien-Wen Chao, Chien-Hung Lin:
Minimizing the sum of job completion times on capacitated two-parallel machines. Eur. J. Oper. Res. 197(2): 475-481 (2009) - 2008
- [j24]Chao-Tang Tseng, Ching-Jong Liao, Tai-Xiang Liao:
A note on two-stage hybrid flowshop scheduling with missing operations. Comput. Ind. Eng. 54(3): 695-704 (2008) - [j23]Chien-Hung Lin, Ching-Jong Liao:
Makespan minimization for multiple uniform machines. Comput. Ind. Eng. 54(4): 983-992 (2008) - [j22]Kuo-Ling Huang, Ching-Jong Liao:
Ant colony optimization combined with taboo search for the job shop scheduling problem. Comput. Oper. Res. 35(4): 1030-1046 (2008) - [j21]Chao-Tang Tseng, Ching-Jong Liao:
A discrete particle swarm optimization for lot-streaming flowshop scheduling problem. Eur. J. Oper. Res. 191(2): 360-373 (2008) - [j20]Ching-Jong Liao, Li-Man Liao:
Improved MILP models for two-machine flowshop with batch processing machines. Math. Comput. Model. 48(7-8): 1254-1264 (2008) - 2007
- [j19]Ching-Jong Liao, Che-Ching Cheng:
A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date. Comput. Ind. Eng. 52(4): 404-413 (2007) - [j18]Ching-Jong Liao, Hsiao-Chien Juan:
An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups. Comput. Oper. Res. 34(7): 1899-1909 (2007) - [j17]Ching-Jong Liao, Chao-Tang Tseng, Pin Luarn:
A discrete version of particle swarm optimization for flowshop scheduling problems. Comput. Oper. Res. 34(10): 3099-3111 (2007) - [j16]Ching-Jong Liao, C.-M. Chen, C.-H. Lin:
Minimizing makespan for two parallel machines with job limit on each availability interval. J. Oper. Res. Soc. 58(7): 938-947 (2007) - 2005
- [j15]Ching-Jong Liao, Der-Lin Shyur, Chien-Hung Lin:
Makespan minimization for two parallel machines with an availability constraint. Eur. J. Oper. Res. 160(2): 445-456 (2005) - 2004
- [j14]Ching-Jong Liao, W. J. Chen:
Scheduling under machine breakdown in a continuous process industry. Comput. Oper. Res. 31(3): 415-428 (2004) - [j13]Kuo-Ching Ying, Ching-Jong Liao:
An ant colony system for permutation flow-shop sequencing. Comput. Oper. Res. 31(5): 791-801 (2004) - [j12]Chien-Hung Lin, Ching-Jong Liao:
Makespan minimization subject to flowtime optimality on identical parallel machines. Comput. Oper. Res. 31(10): 1655-1666 (2004) - 2003
- [j11]Ching-Jong Liao, W. J. Chen:
Single-machine scheduling with periodic maintenance and nonresumable jobs. Comput. Oper. Res. 30(9): 1335-1347 (2003)
1990 – 1999
- 1998
- [j10]Wen-Hwa Yang, Ching-Jong Liao:
Batching and sequencing of jobs with order availability at a single facility. Int. J. Syst. Sci. 29(1): 13-20 (1998) - 1997
- [j9]Ching-Jong Liao, Li-Man Liao:
Single facility scheduling with major and minor setups. Comput. Oper. Res. 24(2): 169-178 (1997) - 1996
- [j8]Wen-Hwa Yang, Ching-Jong Liao:
Group scheduling on two cells with intercell movement. Comput. Oper. Res. 23(10): 997-1006 (1996) - [j7]Ching-Jong Liao:
Optimal scheduling of products with common and unique components. Int. J. Syst. Sci. 27(4): 361-366 (1996) - 1995
- [j6]Ching-Jong Liao, Chien-Lin Sun, Wen-Ching You:
Flow-shop scheduling with flexible processors. Comput. Oper. Res. 22(3): 297-306 (1995) - 1994
- [j5]Ching-Jong Liao:
A new node selection strategy in the branch-and-bound procedure. Comput. Oper. Res. 21(10): 1095-1101 (1994) - [j4]Ching-Jong Liao, Wen-Hwa Yang:
An inventory system with multiple replenishment scheduling. Oper. Res. Lett. 15(4): 213-222 (1994) - 1993
- [j3]Ching-Jong Liao:
Tradeoff between setup times and carrying costs for finished items. Comput. Oper. Res. 20(7): 697-705 (1993) - 1992
- [j2]Ching-Jong Liao, Matthew Rosenshine:
A heuristic for determining the optimal order in a tandem queue. Comput. Oper. Res. 19(2): 133-137 (1992) - [j1]Ching-Jong Liao, Rong-Hwa Huang, Sheng-Tsaing Tseng:
Use of variable range in solving multiple criteria scheduling problems. Comput. Oper. Res. 19(5): 453-460 (1992)
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:40 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:
