姓名：蔡小强 性别：男 E-mail：
　基本介绍
1985.9-1988.7 清华大学自动化系，系统工程专业，博士研究生
1982.2-1985.7 清华大学自动化系，控制理论及应用专业，硕士研究生
1978.2-1982.1 哈尔滨船舶工程学院，自动控制专业，本科
2000年----至今 香港中文大学系统工程与工程管理学系 教授
1996年----2003年 香港中文大学系统工程与工程管理学系 系主任
1996年----2000年 香港中文大学系统工程与工程管理学系 副教授
1993年----1996年 香港中文大学系统工程与工程管理学系 讲师
1991年----1992年 西澳大利亚大学（The University of Western Australia） 数学系 讲师
1990年----1991年 英国贝尔法斯特皇后大学(The Queen’s University of Belfast)电子与电力工程系: 访问研究员
1989年----1990年 英国剑桥大学管理科学研究所，博士后
1988年----1989年 清华大学国家863计划CIMS中心 讲师
? Outstanding Young Scientist Award (Overseas Category, 2004), National Science Foundation of China.
? Principal Investigator/Co-Investigator of more than 20 competitive research grants of about HK$15 millions
? Total number of publications: over 130 (2 books: over 70 journal articles; 10 book chapters; 50 conference proceedings).
? Selected publications:
[1] X. Cai, D. Sha, and C.K. Wong, Time-Varying Network Optimization, XVI, 248 p., ISBN: 978-0-387-71214-7, Springer, 2007.
[2] X. Cai and X. Zhou, Optimal Stochastic Scheduling, accepted by Springer.
[3] X.Q. Cai, X.Y. Wu, and X. Zhou, Stochastic scheduling subject to preemptive-repeat breakdowns with incomplete information. Accepted, Operations Research.
[4] X.Q. Cai, J. Chen, Y.B. Xiao, and X.L. Xu, Optimization and coordination of fresh product supply chains with freshness keeping effort. Accepted (subject to minor revisions), Production and Operations Management.
[5] X.Q. Cai, K.L. Teo, X.Q. Yang, and X.Y. Zhou, Portfolio optimization under a minimax rule. Management Science. 46, pp. 957-972. 2000.
[6] X.Q. Cai and X. Zhou, Stochastic scheduling on parallel machines subject to random breakdowns to minimize expected costs for earliness and tardy jobs. Operations Research. 47, pp. 422-437. 1999.
[7] X.Q. Cai, X.Y. Wu and X. Zhou, Dynamically Optimal policies for stochastic scheduling subject to preemptive-repeat machine breakdowns. IEEE Transactions on Automation Science and Engineering. 2, pp.158-172, 2005.
[8] X.Q. Cai, L.M. Wang, and X. Zhou, Single-machine scheduling to stochastically minimize maximum lateness. Journal of Scheduling. 10. pp. 293-301, 2007.
[9] X.Q. Cai and X. Zhou, Deterministic and stochastic scheduling with team-work tasks. Naval Research Logistics. 51, pp. 818-840, 2004.
[10] X. Cai, K.L. Teo, X.Q. Yang, and X.Y. Zhou, Minimax portfolio optimization: empirical numerical study. Journal of The Operational Research Society. 55, pp.65-72. 2004.
[11] X.Q. Cai, X.Q. Sun, and X. Zhou, Stochastic scheduling with preemptive-repeat machine breakdowns to minimize the expected weighted flowtime. Probability in the Engineering and Informational Sciences. 17, pp. 467-485, 2003.
[12] X.Q. Cai, C.-Y. Lee, and T.L. Wong, Multi-processor task scheduling to minimize the maximum tardiness and the total completion time, IEEE Transactions on Robotics and
Automation. 16, pp. 824-830. 2000.
[13] X. Cai and K.N. Li, A genetic algorithm for scheduling staff of mixed skills under multi-criteria, European Journal of Operational Research. 125, pp. 359-369. 2000.
[14] X.Q. Cai, C.J. Goh and A.I. Mees, Greedy heuristics for rapid scheduling of trains on a single track. IIE Transactions on Scheduling and Logistics. 30, pp. 481-494. 1998.
[15] X. Q. Cai, T. Kloks and C.K. Wong, Time-varying shortest path problems with constraints. Networks. 29, pp. 141-149. 1997.