教授課程

排程理論、作業研究、生產管理

期刊論文

1. Liao, C. J., C. C. Shyu (碩), C. T. Tseng (博) and (2008) A least flexibility first heuristic for setup coordination between two and three stages of a supply chain, International Journal of Production Economics (Accepted). [SCI]
2. Liao, C. J., C. W. Chao (博), and C. H. Lin (博) (2008) Minimizing the sum of job completion times on capacitated two-parallel machines, European Journal of Operational Research (Accepted). [SCI]
3. Tseng, C. T. (博), C. J. Liao, and K. L. Huang (碩) (2008) Minimizing total tardiness on a single machine with controllable processing times, Computers & Operations Research (Accepted). [SCI]
4. Lin, C. H. (博) and C. J. Liao (2008) Minimizing makespan on parallel machines with machine eligibility restrictions, The Open Operational Research Journal, 2, 18–24.
5. Liao, C. J. and L. M. Liao (博) (2008) Improved MILP models for two-machine flowshop with batch processing machines, Mathematical and Computer Modelling 48, 1254–1264. [SCI]
6. Lin, C. H. (博) and C. J. Liao (2008) Makespan minimization for multiple uniform machines, Computers & Industrial Engineering 54, 983–992. [SCI]
7. Tseng, C. T. (博), C. J. Liao, and T. X. Liao (大) (2008) A note on two-stage hybrid flowshop scheduling with missing operations, Computers & Industrial Engineering, 54, 695–704. [SCI]
8. Tseng, C. T. (博) and Liao, C. J. (2008) A discrete particle swarm optimization for lot-streaming flowshop scheduling problem, European Journal of Operational Research 191, 360–373. [SCI]
9. Tseng, C. T. (博) and Liao, C. J. (2008) “A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks,” International Journal of Production Research, 46, 4655–4670. [SCI]
10. Liao, C. J. and C. C. Cheng (碩) (2007) “A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date,” Computers and Industrial Engineering, 52, 4, 404–413. [SCI]
11. Liao, C. J. and C. C. Liao (碩) (2008) “An ant colony optimization algorithm for scheduling in agile manufacturing,” International Journal of Production Research, 46, 1813–1824. [SCI]
12. Huang, K. L. (碩) and C. J. Liao (2008) “Ant colony optimization combined with taboo search for the job shop scheduling problem,” Computers & Operations Research, 35, 1030-1046. [SCI]
13. Liao, C. J., C. M. Chen (碩), and C. H. Lin (博) (2007) “Minimizing makespan for two parallel machines with job limit on each availability interval,” Journal of the Operational Research Society, 58, 938 - 947. [SCI, SSCI]
14. Lin, C. H. (博) and C. J. Liao (2007) "Makespan minimization for two parallel machines with an unavailable period on each machine," International Journal of Advanced Manufacturing Technology, 33, No. 9-10, 1024–1030. [SCI]
15. Liao, C. J., Tseng, C. T. (博), and P. Luarn (同事) (2007) “A discrete version of particle swarm optimization for flowshop scheduling problems,” Computers & Operations Research, 34, No. 10, 3099-3111. [SCI]
16. Liao, C. J. and H. C. Juan (碩) (2007) “An ant colony optimization for single machine tardiness scheduling with sequence-dependent setups,” Computers & Operations Research, 34, No. 7, pp 1899-1909. [SCI]
17. Liao, C. J., L. M. Liao (博), and C. T. Tseng (博) (2006) “A performance evaluation of permutation vs. non-permutation schedules in a flowshop,” International Journal of Production Research, 44, 4297–4309. [SCI]
18. Liao, C. J., Shyur, D. L., and Lin, C. H., 2006, “Makespan minimization for two parallel machines with an availability constraint,” European Journal of Operational Research, 160, pp 445-456. [SCI] [NSC-92-2213-E-011-059]
19. Chen, W. J. and Liao, C. J., 2004, “Scheduling with Different maintenance Polices in a textile company,” Journal of Quality in Maintenance Engineering (accepted). [EI]
20. Ying, G. C. and Liao, C. J., 2004 “Ant Colony System for Permutation Flow-shop Sequencing,” Computers and Operations Research, 31, pp 791-801. [SCI] [NSC-92-2213- E-011-058]
21. Lin, C. H. and Liao, C. J., 2004, “Makespan Minimization Subject to Flowtime Optimality on Identical Parallel Machines,” Computers and Operations Research, Vol. 31, pp 1655-1666. [SCI] [NSC-92-2213-E-011-059]
22. Liao, C. J. and Chen, W. J., 2004, “Scheduling under machine breakdown in a continuous industry,” Computers and Operations Research, Vol. 31, pp 415-428. [SCI]

研討會論文

1. Tseng, C. T., Liao, C. J., and Huang, K. L., 2005, “Minimizing the total tardiness in a single machine with controllable processing times,”Chinese Institute of Industrial Engineering Conference, Hsin-Chu, Taiwan.
2. Liao, T. S., Tseng, C. T., Lu, W. C., and Liao, C. J., 2005, “Two-stage hybrid flowshop scheduling with missing operations,”Chinese Institute of Industrial Engineering Conference, Hsin-Chu, Taiwan.
3. Lin, C. H. and Liao, C. J., 2004, “Makespan Minimization for Two Parallel Machines with Availability Constraints,”第一屆台灣作業研究學會學術研討會, pp. 289-296.
4. Liao, C.J. 2002, 「局部搜尋法在流程型工廠多準則排程之研究」，國科會工業工程學門成果發表會，逢甲大學。
5. Liao, C.J. 2001, 「護士的雇用及排班之整合決策」，國科會工業工程學門成果發表會，雲林科技大學。

 其他著作

1. 廖慶榮著，2004，作業研究，華泰文化。
2. 廖慶榮著，2002，個人時間管理（簡體版），杭州出版社（中國大陸）。
3. Huang, K. L. and Liao, C. J., 2004, “Ant colony optimization combined with taboo search for the job shop scheduling problem,” submitted to IEEE Transactions on Automation Science and Engineering.
4. Liao, C. J., Chen, C. M., and Lin, C. H., 2004, “Minimizing makespan for two parallel machines with job limit on each availability interval,” submitted to European Journal of Operational Research.
5. Liao, C. J. and Juan, H. C., 2004, “An ant colony optimization for single machine weighted tardiness scheduling with sequence-dependent setups,” submitted to Computers & Operations Research.
6. 廖慶榮，「研究報告格式手冊」，五南書局，台北 (1994)。
7. 廖慶榮，「作業研究」，三民書局，台北 (1994)。
8. 廖慶榮、廖麗滿，「作業研究題解」，三民書局，台北 (1995)。
9. 廖慶榮，「個人時間管理」，實學社，台北 (1995)。