A

期刊論文

1.	Ching-Fang Liaw and Chelsea C. White, III., 1996,“A heuristic search approach for solving a minimum path problem requiring arc cost determination,” IEEE Transactions on Systems, Man, and Cybernetics -Part A: Systems and Humans, Vol.26, No.5, pp.545-551.
2.	Ching-Fang Liaw, Bradley S. Stewart, and Chelsea C. White, III., 1995,“Multiobjective heuristic search in AND/OR graphs,” IEEE Transactions on Systems, Man, and Cybernetics, Vol.25, No.11, pp.1513-1521.
3.	Bradley S. Stewart, Ching-Fang Liaw, and Chelsea C. White, III., 1994, “A bibliography of heuristic search research through 1992,” IEEE Transactions on Systems, Man, and Cybernetics, Vol.24, No.2, pp268-293.
4.	Ching-Fang Liaw, James Banders, and Chelsea C. White, III., 1996, ”A decision support system for the bimodel dial-a-ride problem,” IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans, Vol.26, No.5, pp.552-565.
5.	Ching-Fang Liaw, 1999, “A tabu search algorithm for the open shop scheduling problem”, Computers and Operations Research, Vol. 26, No. 2, pp. 109-126.
6.	Ching-Fang Liaw, 1998, “An iterative improvement approach for the nonpreemptive open shop scheduling problem”, European Journal of Operational Research, Vol. 111, No. 3, pp. 89-97.
7.	Ching-Fang Liaw, 1999, “A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem”, Computers and Operations Research, Vol. 26, pp. 679-693.
8.	Ching-Fang Liaw, 1999, “Applying simulated annealing to the open shop scheduling problem”, IIE Transactions, Scheduling and Logistics, Vol. 31, No. 5, pp. 457-465.
9.	Ching-Fang Liaw, 2000, “A hybrid genetic algorithm for the open shop scheduling problem”, European Journal of Operational Research, Vol. 124, No. 1, pp. 28-42.
10.	Ching-Fang Liaw, Chun-Yuan Cheng, and Mingchih Chen, 2001, “The total completion time open shop scheduling problem with a given sequence of jobs on one machine”, Computers and Operations Research, Vol. 29, No. 9, p. 137-152.
11.	廖經芳、林安祥，2001，『開放工廠總加權延遲最小化排程問題之研究』，工業工程學刊, Vol. 18, No. 6, p. 29-42.
12.	Ching-Fang Liaw, Yang-Kuei Lin, Chun-Yuan Cheng and Mingchih Chen, 2003, "Scheduling Unrelated Parallel Machines to Minimize Total Weighted Tardiness", Computers and Operations Research , Vol. 30, No. 12, p. 1777-1789.
13.	Ching-Fang Liaw, 2003, “An Efficient Tabu Search Approach for the Two-Machine Preemptive Open Shop Scheduling Problem”, Computers and Operations Research , Vol. 30, No. 14, p. 2081-2095.
14.	Ching-Fang Liaw, 2004,“Scheduling two-machine preemptive open shops to minimize total completion time”, Computers and Operations Research, Vol. 31, p. 1349-1363.
15.	Ching-Fang Liaw, 2005,“Scheduling Preemptive Open Shops to Minimize Total Tardiness”, European Journal of Operational Research, Vol. 162, p. 173-183.
16.	Ching-Fang Liaw, Chun-Yuan Cheng, Mingchih Chen, 2005,“Scheduling two-machine no-wait open shops to minimize makespan”, Computers and Operations Research, Vol. 32, pp. 901-917.
17	Ching-Fang Liaw, 2008, “An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops”, Computers and Operations Research (in Press)
18	Ching-Fang Liaw, 2009, “Scheduling preemptive open shops to minimize number of tardy jobs”, Computers and Operations Research (submitted)

　

專書及研討會論文

1.	Ching-Fang Liaw, 1994, “Heuristic search and its transit applications”, Ph.D. Dissertation, University of Michigan, Ann Arbor, Michigan.
2.	Ching-Fang Liaw, 1999, “A hybrid genetic algorithm for the open shop scheduling problem”, Proceedings of the Chinese Institute of Industrial Engineers, National conference, pp.36-41, 1998.
3.	林安祥，廖經芳，1999, ”開放工廠總加權延遲最小化排程問題之研究”，八十八年工業工程年會論文集。
4.	Chien-Yuan Lin, Ching-Fang Liaw and Wen-Hsiang Liao, “Spatial Distribution of Fire Fighting Units in Taipei City”, 1990, Proceedings of the 1990 Conference of Chinese Institute of Urban Planning and Chinese, Japanese and Korean Urban Planning Association’s Academic Exchange Symposium, September 11-12, 1990, Taipei, Taiwan.
5.	施大維，廖經芳，1999, ”開放工廠總加權流程時間最小化排程問題之研究”，八十八年工業工程年會論文集。
6.	Ching-Fang Liaw, Yang-Kue Lin and Mingchih Chen, 2000, "A branch-and-bound algorithm for unrelated parallel-machine total weighted tardiness scheduling problem", Proceedings of the 5^th Annual International Conference on Industrial Engineering-Theory, Applications and Practice. 國科會計畫:NSC89-2213-E-324-044.
7.	Chun-Ching Lin, Ching-Fang Liaw, Mingchih Chen, 2000, "A Genetic Algorithm Approach to Minimize Total Weighted Tardiness for Unrelated Parallel Machines", Proceedings of the 5^th Annual International Conference on Industrial Engineering-Theory, Applications and Practice.
8.	Ching-Fang Liaw, 2002, “A heuristic approach for the two-machine preemptive open shop scheduling problem”, The 9th Bellman Continuum: International Workshop on Uncertain Systems and Soft Computing, Beijing, China.
9.	Mingchih Chen, Chun-Yuan Cheng, Ching-Fang Liaw, Chun-Ching Lin, 2002, “The Parameterization Method of Multi-Objective Genetic Algorithm for Unrelated Parallel Machines Scheduling Problem”, Proceedings of the 4^th Asia-Pacific Conference on the Industrial Engineering and Management Systems, Taipei, Taiwan.
10.	Ching-Fang Liaw, 2003, “An Efficient Tabu Search Approach for the Two-Machine Preemptive Open Shop Scheduling Problem”, 九十二年工業工程與管理學門專題研究計畫成果發表會
11.	Chun-Yuan Cheng, Ching-Fang Liaw, Min Wang, 2004, “Periodic Preventive Maintenance Models for Deteriorating Systems With Considering Failure Limit”, 4^th International Conference on Mathematical Methods in Reliability—Methodology and Practices, Santa Fe, New Mexico.
12.	Chun-Yuan Cheng and Ching-Fang Liaw, 2005, “Statistical Estimation on Imperfectly Maintained System”, European Safety & Reliability Conference 2005 (ESREL 2005), Tri-City, Poland.
13.

　