廖經芳助理副校長兼秘書長-研究成果及著作

  1. 期刊論文
  1. Bradley S. Stewart, Ching-Fang Liaw, and Chelsea C. White, III., “A bibliography of heuristic search research through 1992”, IEEE Transactions on Systems, Man, and Cybernetics, Vol. 24, No. 2, p. 268-293, 1994. (SCI)
  2. Ching-Fang Liaw, Bradley S. Stewart, and Chelsea C. White, III.,  “Multiobjective heuristic search in AND/OR graphs”, IEEE Transactions on Systems, Man, and Cybernetics, Vol. 25, No. 11, p. 1513-1521, 1995. (SCI)
  3. Ching-Fang Liaw and Chelsea C. White, III.,  “A heuristic search approach for solving a minimum path problem requiring arc cost determination”, IEEE Transactions on Systems, Man, and Cybernetics, Vol. 26, No. 5, p. 545-551, 1996. (SCI)
  4. Ching-Fang Liaw, James Banders, and Chelsea C. White, III.,  “A decision support system for the bimodal dial-a-ride problem”, IEEE Transactions on Systems, Man, and Cybernetics, Vol. 26, No. 5, pp 552-565, 1996. (SCI)
  5. Ching-Fang Liaw,  “An iterative improvement approach for the nonpreemptive open shop scheduling problem”, European Journal of Operational Research, Vol. 111, No. 3, p. 89-97, 1998. (SCIE) ( NSC 86-2213-E-324-001)
  6. Ching-Fang Liaw,  “A Tabu search algorithm for the open shop scheduling problem”, Computers and Operations Research, Vol. 26, No. 2, p. 109-126, 1999. (SCIE) (NSC 87-2213-E-324-005)
  7. Ching-Fang Liaw,  “A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem”, Computers and Operations Research, Vol. 26, p. 679-693, 1999. (SCIE) (NSC 88-2213-E-324-011)
  8. Ching-Fang Liaw,  “Applying simulated annealing to the open shop scheduling problem”, IIE Transactions, Scheduling and Logistics, Vol. 31, No. 5, p. 457-465, 1999. (SCIE)
  9. Ching-Fang Liaw,  “A hybrid genetic algorithm for the open shop scheduling problem”, European Journal of Operational Research, Vol. 124, p. 28-42, 2000. (SCIE)
  10. Ching-Fang Liaw, and An-Hsiang Lin, "Scheduling open shops to minimize total weighted tardiness", Journal of the Chinese Institute of Industrial Engineers, Vol. 18, No. 6, p. 29-42, 2001. (EI) (NSC 89-2213-E-324-012)
  11. Ching-Fang Liaw, Chun-Yuan Cheng and Mingchih Chen , “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, 2002. (SCIE) (NSC 90-2218-E-324-008)
  12. Ching-Fang Liaw, Yang-Kuei Lin, Chun-Yuan Cheng and Mingchih Chen , “Scheduling Unrelated Parallel Machines to Minimize Total Weighted Tardiness”, Computers and Operations Research , Vol. 30, No. 12, p. 1777-1789, 2003. (SCIE) (NSC 89-2213-E-324-044)
  13. Ching-Fang Liaw, “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, 2003. (SCIE)
  14. Ching-Fang Liaw, “Scheduling two-machine preemptive open shops to minimize total completion time”, Computers and Operations Research, Vol. 31, p. 1349-1363, 2004. (SCIE)
  15. Ching-Fang Liaw, “Scheduling Preemptive Open Shops to Minimize Total Tardiness”, European Journal of Operational Research, Vol. 162, p. 173-183, 2005. (SCIE)
  16. Ching-Fang Liaw, “Scheduling two-machine no-wait open shops to minimize makespan”, Computers and Operations Research, Vol. 32, p. 901-917, 2005. (SCIE)
  17. Ching-Fang Liaw, “An Efficient Simple Metaheuristic for Minimizing the Makespan in Two-Machine No-Wait Job Shops”, Computers and Operations Research , Vol. 35, p. 3276-3283, 2008. (SCIE)
  18. Ching-Fang Liaw, “An improved branch-and-bound algorithm for the preemptive open shop total completion time scheduling problem”, Journal of Industrial and Production Engineering, 30(5), p. 327-335, 2013. (TSSCI)
  19. Ching-Fang Liaw, “A Fast Heuristic to Minimize Number of Tardy Jobs in Preemptive Open Shops”, Journal of Industrial and Production Engineering, 31(1), p. 27-35, 2014. (TSSCI)
  20. Ching-Fang Liaw, “A branch-and-bound algorithm for identical parallel-machine total completion time scheduling problem with preemption and release times”, Journal of Industrial and Production Engineering, 33(6), p. 383-390, 2016. (TSSCI)
  21. Ching-Fang Liaw, “A branch-and-bound algorithm for identical parallel-machine total tardiness scheduling problem with preemption”, Journal of Industrial and Production Engineering, 33(6), p. 426-434, 2016. (TSSCI)
  22. Tao-Ming Cheng, Hsing-Yu Hou, Dinesh Chandra Agrawal, Ching-Fang Liaw and Rung-Ching Chen, “Remedial education for high-risk university freshmen – the case of a university of technology in Taiwan”, Asia Pacific Journal of Education, 38(2), p. 241-256, 2018.
  23. Ching-Fang Liaw, Wan-Chi Jackie Hsu and Huai-Wei Lo, “A Hybrid MCDM Model to Evaluate and Classify Outsourcing Providers in Manufacturing”, Symmetry 2020, 12, 1962, 2020.
  24. Huai-Wei Lo, Ching-Fang Liaw, Muhammet Gul and Kuan-Yu Lin, “Sustainable supplier evaluation and transportation planning in multi-level supply chain networks using multi-attribute- and multi-objective decision making”, Computers & Industrial Engineering, in revision, 2021. (SCI)
  25. Ching-Fang Liaw, Minimizing the total weighted completion time for identical parallel-machine scheduling with preemption and release times”, Journal of Industrial and Production Engineering, in revision, 2021. (TSSCI)

(B) 研討會論文

  1. 鄭純媛、廖經芳、游擱鴻,1997,「半導體晶圓生產週期管理之研究」,邁向二十一世紀的品質與管理技術應用研討會(1997)論文集,第418頁至第429.
  2. Ching-Fang Liaw, 1998, “A Hybrid Genetic Algorithm for the Open Shop Scheduling Problem”, Proceedings of the Chinese Institute of Industrial Engineers, National Conference, 1998, pp. 36-41.
  3. 施大維,廖經芳1999,「開放工廠加權總流程時間最小化排程問題之研究」,88年度工業工程年會論文集。
  4. 林安祥,廖經芳1999,「開放工廠總加權延遲最小化排程問題之研究」,88年度工業工程年會論文集。
  5. 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 5th Annual International Conference on Industrial Engineering-Theory, Applications and Practice.
  6. 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 5th Annual International Conference on Industrial Engineering-Theory, Applications and Practice.
  7. Ching-Fang Liaw, 2002, “An Efficient Tabu Search Approach for the Two-Machine Preemptive Open Shop Scheduling Problem”, Proceedings of the 9th Bellman Continuum: International Workshop on Uncertain Systems and Soft Computing, Beijing, China.
  8. 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 4th Asia-Pacific Conference on the Industrial Engineering and Management Systems, Taipei, Taiwan.
  9. Chun-Yuan Cheng, Ching-Fang Liaw, Min Wang, 2004, “Periodic Preventive Maintenance Models for Deteriorating Systems With Considering Failure Limit”, 4th International Conference on Mathematical Methods in Reliability—Methodology and Practices, Santa Fe, New Mexico, Jun. 21-25, 2004.
  10. Chun-Yuan Cheng and Ching-Fang Liaw, 2005, “Statistical Estimation on Imperfectly Maintained System”, European Safety & Reliability Conference 2005 (ESREL 2005), Tri-City, Poland, Jun. 27-30, pp 351-356, 2005.

(C) 專書及專書論文

  1. Ching-Fang Liaw, 1994, “Heuristic search and its transit applications,”Ph.D. Dissertation, University of Michigan, Ann Arbor, Michigan.

(D) 技術報告及其他

  1. 鄭純媛、廖經芳1996,「半導體晶圓生產週期管理之研究」,國科會專題研究計畫成果報告。計畫編號:NSC 85-2213-E-324-001.
  2. 廖經芳1997,「不可分割開放式工廠排程問題啟發式演算法之研究」,國科會專題研究計畫成果報告。計畫編號:NSC 86-2213-E-324-001.
  3. 廖經芳1998,「塔布搜尋法應用於開放式工廠排程問題之研究」,國科會專題研究計畫成果報告。計畫編號:NSC 87-2213-E-324-005.
  4. 廖經芳1999,「單機總加權提前及延遲最小化排程問題之研究」,國科會專題研究計畫成果報告。計畫編號:NSC 88-2213-E-324-011.
  5. 廖經芳2000,「開放工廠總加權延遲極小化排程問題之研究」,國科會專題研究計畫成果報告。計畫編號:NSC 89-2213-E-324-012.
  6. 廖經芳2001,「不相關平行機器總加權延遲最小化排程問題之研究」,國科會專題研究計畫成果報告。計畫編號:NSC 89-2213-E-324-044.
  7. 廖經芳2002,「考慮先後順序限制之開放工廠總完工時間最小化排程問題之研究」,國科會專題研究計畫成果報告。計畫編號:NSC 90-2218-E-324-008.
  8. 廖經芳2003,「可中斷開放工廠排程問題之研究(1/3)」,國科會專題研究計畫成果報告。計畫編號:NSC 91-2213-E-324-017.
  9. 廖經芳2004,「可中斷開放工廠排程問題之研究(2/3)」,國科會專題研究計畫成果報告。計畫編號:NSC 92-2213-E-324-003.
  10. 廖經芳2005,「可中斷開放工廠排程問題之研究(3/3)」,國科會專題研究計畫成果報告。計畫編號:NSC 93-2213-E-324-002.
  11. 廖經芳2006,「雙機連續性製程工廠排程問題之研究(1/3)」,國科會專題研究計畫成果報告。計畫編號:NSC 94-2213-E-324-012.
  12. 廖經芳2007,「雙機連續性製程工廠排程問題之研究(2/3)」,國科會專題研究計畫成果報告。計畫編號:NSC 95-2221-E-324-027.
  13. 廖經芳2008,「雙機連續性製程工廠排程問題之研究(3/3)」,國科會專題研究計畫成果報告。計畫編號:NSC 96-2221-E-324-017.
  14. 廖經芳2009,「作業處理可分割之開放工廠排程問題之研究」,國科會專題研究計畫成果報告。計畫編號:NSC 97-2221-E-324-019-MY3.
  15. 廖經芳2010,「作業處理可分割之開放工廠排程問題之研究」,國科會專題研究計畫成果報告。計畫編號:NSC 97-2221-E-324-019-MY3.
  16. 廖經芳2011,「作業處理可分割之開放工廠排程問題之研究」,國科會專題研究計畫成果報告。計畫編號:NSC 97-2221-E-324-019-MY3.
  17. 廖經芳2012,「可中斷式開放工廠排程問題理論性質與求解方法之研究(I)」,國科會專題研究計畫成果報告。計畫編號:NSC 100-2221-E-324-015.
  18. 廖經芳2013,「可中斷式開放工廠排程問題求解方法之研究」,國科會專題研究計畫成果報告。計畫編號:NSC 101-2221-E-324-010-MY2.
  19. 廖經芳2014,「可中斷式開放工廠排程問題求解方法之研究」,國科會專題研究計畫成果報告。計畫編號:NSC 101-2221-E-324-010-MY2.
  20. 廖經芳2016,「作業處理可分割相同平行機器排程問題求解方法之探討」,科技部專題研究計畫成果報告。計畫編號:NSC 105-2221-E-324-015.

 

瀏覽數: