Prof. CAI, Xiaoqiang 蔡 小 強 教授

Prof. CAI, Xiaoqiang 蔡 小 強 教授

Prof. CAI, Xiaoqiang 蔡 小 強 教授
Emeritus Professor
BEng (Harbin Shipbuilding Engineering Institute)
MEng, DEng (Tsinghua University)

Research Interests :
* Logistics and Supply
_Chain Management
* New Scheduling Models
_and Applications
* Portfolio Optimization

Email Address:
xqcai@se.cuhk.edu.hk

Biography

Xiaoqiang Cai is Professor at the Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong. He is also Dean of General Education of Lee Woo Sing College, Director of the Center for Logistics Technologies & Supply Chain Optimization, and Director of the CUHK/Tsinghua Joint Executive M.Sc. Program in Logistics and Supply Chain Management. He received his Ph.D. from Tsinghua University, Beijing, in 1988. During 1989 to 1991, he conducted postdoctoral research at The University of Cambridge and The Queen’s University of Belfast. He was Lecturer at The University of Western Australia in 1991 to 1992, before joining CUHK in 1993. He served as the Chairman of Department of SEEM during 1996 to 2003, and has been Professor since October 2000. His current research is focused on scheduling theory and applications, logistics and supply chain management, and portfolio optimization. He has published over 100 papers in leading journals in these areas, including Operations Research, Management Science, Production and Operations Management, Naval Research Logistics, IIE Transactions, and IEEE Transactions. He has been on the editorial boards of several international journals, including IIE Transactions on Scheduling and Logistics, Journal of Scheduling, and Fuzzy Decision Making and Optimization.

He has also been appointed, concurrently, Associate Vice President and Presidential Chair Professor of The Chinese University of Hong Kong, Shenzhen. He is an Academician of the International Academy for Systems and Cybernetic Sciences, and a Fellow of Hong Kong Institute of Engineers.

 

Selected Publications

Y.L. Zeng, L.M. Zhang, X.Q. Cai, and J. Li, Cost sharing for capacity transfer in cooperating queueing systems, Production and Operations Management. 27. Issue 4, pp. 644-662, April 2018.

X. Cai and X. Zhou, “Optimal policies for perishable products when transportation to export market is disrupted”, Production and Operations Management, 23, pp. 907-923, 2014.

X. Cai, J. Chen, Y.B. Xiao, X.L. Xu, and G. Yu, “Fresh-product supply chain management with logistics outsourcing”, Omega, 41, pp. 752-765, 2013.

X. Cai, and G.L. Vairaktarakis, “Coordination of outsourced operations at a third-party facility subject to booking, overtime, and tardiness costs”, Operations Research, 60, pp. 1436-1450, 2012.

X. Cai, J. Chen, Y.B. Xiao, and X.L. Xu, “Optimization and Coordination of Fresh Product Supply Chains with Freshness- Keeping Effort”, Production and Operations Management, 19(3), 261-278, 2010.

X. Cai, X.Y. Wu, and X. Zhou, “Stochastic scheduling subject to preemptive-repeat breakdowns with incomplete information”, Operations Research, 57(5), 1236-1249, 2009.

X. Cai, X.Y. Wu, and X. Zhou, “Single-machine scheduling with general costs under compound-type distributions”. Journal of Scheduling, 10(1), 77-84, 2007.

X. 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 (2),158-172, 2005.

X. Cai, X.Q. Sun, and X. Zhou, “Stochastic Scheduling Subject to Machine Breakdowns: The Preemptive-Repeat Model with Discounted Reward and Other Criteria”, Naval Research Logistics, 51, 800-817, 2004.
X. Cai, K.L. Teo, X.Q. Yang, and X.Y. Zhou, “Portfolio Optimization under a Minimax Rule”, Management Science, 46, 957-972, 2000.

X. 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, 824-830, 2000.

X. Cai and S. Zhou, “Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs”, Operations Research, 47, 422-437, 1999.