default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChing-Fang Liaw
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j17]Huai-Wei Lo
, Ching-Fang Liaw, Muhammet Gul, Kuan-Yu Lin:
Sustainable supplier evaluation and transportation planning in multi-level supply chain networks using multi-attribute- and multi-objective decision making. Comput. Ind. Eng. 162: 107756 (2021)- 2020
- [j16]Ching-Fang Liaw, Wan-Chi Jackie Hsu, Huai-Wei Lo:
A Hybrid MCDM Model to Evaluate and Classify Outsourcing Providers in Manufacturing. Symmetry 12(12): 1962 (2020) - 2008
- [j15]Ching-Fang Liaw:
An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops. Comput. Oper. Res. 35(10): 3276-3283 (2008) - 2005
- [j14]Ching-Fang Liaw, Chun-Yuan Cheng, Mingchih Chen:
Scheduling two-machine no-wait open shops to minimize makespan. Comput. Oper. Res. 32: 901-917 (2005) - [j13]Ching-Fang Liaw:
Scheduling preemptive open shops to minimize total tardiness. Eur. J. Oper. Res. 162(1): 173-183 (2005) - 2004
- [j12]Ching-Fang Liaw:
Scheduling two-machine preemptive open shops to minimize total completion time. Comput. Oper. Res. 31(8): 1349-1363 (2004) - 2003
- [j11]Ching-Fang Liaw, Yang-Kuei Lin, Chun-Yuan Cheng, Mingchih Chen:
Scheduling unrelated parallel machines to minimize total weighted tardiness. Comput. Oper. Res. 30(12): 1777-1789 (2003) - [j10]Ching-Fang Liaw:
An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. Comput. Oper. Res. 30(14): 2081-2095 (2003) - 2002
- [j9]Ching-Fang Liaw, Chun-Yuan Cheng, Mingchih Chen:
The total completion time open shop scheduling problem with a given sequence of jobs on one machine. Comput. Oper. Res. 29(9): 1251-1266 (2002) - 2000
- [j8]Ching-Fang Liaw:
A hybrid genetic algorithm for the open shop scheduling problem. Eur. J. Oper. Res. 124(1): 28-42 (2000) - 1999
- [j7]Ching-Fang Liaw:
A tabu search algorithm for the open shop scheduling problem. Comput. Oper. Res. 26(2): 109-126 (1999) - [j6]Ching-Fang Liaw:
A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. Comput. Oper. Res. 26(7): 679-693 (1999) - 1998
- [j5]Ching-Fang Liaw:
An iterative improvement approach for the nonpreemptive open shop scheduling problem. Eur. J. Oper. Res. 111(3): 509-517 (1998) - 1996
- [j4]Ching-Fang Liaw, Chelsea C. White III:
A heuristic search approach for solving a minimum path problem requiring arc cost determination. IEEE Trans. Syst. Man Cybern. Part A 26(5): 545-551 (1996) - [j3]Ching-Fang Liaw, Chelsea C. White III, James L. Bander:
A decision support system for the bimodal dial-a-ride problem. IEEE Trans. Syst. Man Cybern. Part A 26(5): 552-565 (1996) - 1995
- [j2]Ching-Fang Liaw, Bradley S. Stewart, Chelsea C. White III:
Multiobjective heuristic search in AND/OR graphs. IEEE Trans. Syst. Man Cybern. 25(11): 1513-1521 (1995) - 1994
- [j1]Bradley S. Stewart, Ching-Fang Liaw, Chelsea C. White III:
A Bibliography of Heuristic Search Research Through 1992. IEEE Trans. Syst. Man Cybern. Syst. 24(2): 268-293 (1994)
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 22:56 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:
