登录帮助返回首页交大主页




蔡小强主页:个人信息科研项目论文著作荣誉奖励科研团队课程教学招生信息English
基本信息
蔡小强,教授,博导

博士学科：管理科学与工程

工作单位：经济管理学院
联系方式
通信地址：西南交通大学经济管理学院

电子邮箱：caixiaoqiang@home.swjtu.edu.cn

个人简介
蔡小强，男，博士，香港中文大学系统工程及工程管理学系教授。1988年获清华大学系统工程博士学位。曾任教于西澳大利亚大学。担任IIE Transactions on Scheduling and Logistics; Journal of Scheduling; Fuzzy Optimization and Decision Making; Dynamics of Continuous, Discrete and Impulsive Systems (Series B); Journal of Systems Science and Complexity 等学术刊物编委。研究和教学领域：最优调度，网络优化，物流及运输系统管理。曾获IEEE系统、人与控制论学会杰出贡献奖，霍英东青年教师奖。
主要研究方向
[1]物流与供应链管理；

[2]调度模型与算法；

[3]网络优化与组合优化。
Copyright ? 2011 http://inc.swjtu.edu.cn 西南交通大学信息网络中心



-----------------------------------------------------------------
登录帮助返回首页交大主页




蔡小强主页:个人信息科研项目论文著作荣誉奖励科研团队课程教学招生信息English
科学研究
[1]Scheduling with Negotiable Third-Party Machines, RGC专用研究基金, 2002-2005.

[2]Joint R&D Project with Tsinghua University on Chinese Enterprise Internet Operations. Drs Richard Charles and Esther Yewpick Lee 基金, 2002-2005.

[3]Internet-based Supply Chain Management Systems, UGC信息技术杰出领域基金(Internet Applications Track), 2001-2004.

[4]Stochastic Scheduling with Preemptive-repeat Machine Breakdowns, RGC专用研究基金, 2001-2004.

[5]Deterministic and Stochastic Scheduling Models for Team-Work Jobs, RGC专用研究基金, 2000-2003.

[6]International Logistics Operation Management,European Commission Asia-Link Programme, 2006-2008,CN/ASIA-LINK/031 (110-412)，主持.

[7]Earliness/Tardiness Scheduling Subject to Known Due Dates and an Unknown Deadline, RGC专用研究基金, 2000-2003.

[8]A Class of New Time-Varying Network Models with Controllable Flow Departure/Arrival Times, RGC专用研究基金, 1998-2001.
Copyright ? 2011 http://inc.swjtu.edu.cn 西南交通大学信息网络中心



-----------------------------------------------------------------
登录帮助返回首页交大主页




蔡小强主页:个人信息科研项目论文著作荣誉奖励科研团队课程教学招生信息English
学术论文
[1]X. Cai, J. Chen, Y.B. Xiao, and X.L. Xu, "Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline". Computers and Operations Research. Vol. 35, pp. 1671-1683. 2008.

[2]X. Cai, X.Y. Wu, and X. Zhou, "Single-machine scheduling with general costs under compound-type distributions". Journal of Scheduling. Vol. 10, pp. 77-84. 2007.

[3]X.P. Song and X. Cai, "On optimal payment time for a retailer under permitted delay of payment by the wholesaler", International Journal of Production Economics, Vol. 103, pp.246-251, June 2006.

[4]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. Vol. 2, pp. 158-172, April 2005.

[5]A.S.F. Ng, T. Sastry, J. Leung, and X. Cai, "On the Uncapacitated K-Commodity Network Design Problem with Zero Flow-Costs". Naval Research Logistics. Vol. 51, pp. 1149-1172, 2004.

[6]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, Vol. 51, pp. 800-817, 2004.

[7]X. Cai and X. Zhou, "Deterministic and Stochastic Scheduling with Team-Work Tasks". Naval Research Logistics, Vol. 51, pp. 818-840, 2004.

[8]X. Cai, K.L. Teo, X.Q. Yang, and X.Y. Zhou,"Minimax Portfolio Optimization: Empirical Numerical Study". Journal of The Operational Research Society, Vol. 55, pp 65-72. 2004

[9]X. 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, Vol. 17, pp. 467-485. December 2003.

[10]George Vairaktarakis, and X. Cai, "The Value of Processing Flexibility in Multipurpose Machines". IIE Transactions on Scheduling and Logistics, Vol. 35, pp. 763-774. 2003.

[11]G.C. Zhang, X. Cai, C.-Y. Lee, and C.K. Wong, "Minimizing Makespan on a Single Batch Processing Machine with Nonidentical Job Sizes". Naval Research Logistics, Vol. 48, pp. 226-240. 2001.

[12]X. Cai, K.L. Teo, X.Q. Yang, and X.Y. Zhou, "Portfolio Optimization under a Minimax Rule". Management Science, Vol. 46, pp. 957-972. 2000.

[13]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. Vol. 16, pp. 824-830. December 2000.

[14]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,Vol.47, pp. 422-437, 1999.

[15]C.L. Li, X. Cai and C.Y. Lee, "Machine Scheduling withMultiple-Job-On-One-Processor Pattern". IIE Transactions on Scheduling and Logistics, Vol. 30, pp. 433-446, 1998.

[16]X. 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, Vol. 30, pp. 481-494. 1998
著作
[1] 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. Vol.47, pp. 422-437, May-June 1999.

[2] 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. Vol. 16, pp. 824-830. December 2000.

[3] G.C. Zhang, X. Cai, and C.K. Wong, "On-Line Algorithms for Minimizing Makespan on Batch Processing Machines with Dynamic Job Arrivals'', accepted for publication in Naval Research Logistics.

[4] X. Cai, D. Sha and C.K. Wong, "Time-Varying Minimum Cost Flow Problems'', accepted for publication in European Journal of Operational Research.

[5] X. Cai and S. Zhou, "Asymmetric Earliness and Tardiness Scheduling with Exponential Processing Times on an Unreliable Machine'', accepted for publication in Annals of Operations Research.

[6] C.T. Ng, X. Cai and T.C.E. Cheng,"Probabilistic Analysis of an Asymptotically Optimal Solution for the Completion Time Variance Problem''. Naval Research Logistics. Vol. 46, pp. 373-398, June 1999.

[7] C.L. Li, X. Cai and C.Y. Lee,"Machine Scheduling with Multiple-Job-On-One-Processor Pattern''. IIE Transactions on Scheduling and Logistics. Vol. 30, pp. 433-446, May 1998.

[8] X. Cai and T.C.E. Cheng, "Multi-Machine Scheduling with Variance Minimization''. Discrete Applied Mathematics, Vol. 84, pp. 55-70. June 1998.

[9] X. 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, Vol. 30, pp. 481-494. May 1998.

[10] X. Cai, C.Y. Lee and C.L. Li, "Minimizing Total Flow Time in Two-Processor Task Systems with Prespecified Processor Allocations''. Naval Research Logistics, Vol. 45, pp. 231-242. March 1998.

[11] X. Cai and S. Zhou, "Scheduling Stochastic Jobs with Asymmetric Earliness and Tardiness Penalties''. Naval Research Logistics, Vol. 44, pp. 531-557. Sep. 1997.

[12] X. Cai, T. Kloks and C.K. Wong, "Time-Varying Shortest Path Problems with Constraints''. Networks, Vol. 29, pp. 141-149. 1997.

[13] X. Cai and S. Zhou, "Sequencing Jobs with Random Processing Times to Minimize Weighted Completion Time Variance''. Annals of Operations Research, Vol. 70, pp. 241-260. April 1997.

[14] X. Cai and F.S. Tu, "Scheduling Jobs with Random Processing Times on a Single Machine Subject to Stochastic Breakdowns to Minimize Early-Tardy Penalties''. Naval Research Logistics, Vol. 43, pp. 1127-1146. December 1996.

[15] X. Cai, "Minimization of Agreeably Weighted Variance in Single Machine Systems''. European Journal of Operational Research, Vol. 85, pp. 576-592. 1995.
Copyright ? 2011 http://inc.swjtu.edu.cn 西南交通大学信息网络中心



-----------------------------------------------------------------
登录帮助返回首页交大主页




蔡小强主页:个人信息科研项目论文著作荣誉奖励科研团队课程教学招生信息English
荣誉奖励
曾获IEEE系统、人与控制论学会杰出贡献奖，霍英东青年教师奖.
Copyright ? 2011 http://inc.swjtu.edu.cn 西南交通大学信息网络中心



-----------------------------------------------------------------
登录帮助返回首页交大主页




蔡小强主页:个人信息科研项目论文著作荣誉奖励科研团队课程教学招生信息English
科研团队
科研团队介绍
Copyright ? 2011 http://inc.swjtu.edu.cn 西南交通大学信息网络中心



-----------------------------------------------------------------
登录帮助返回首页交大主页




蔡小强主页:个人信息科研项目论文著作荣誉奖励科研团队课程教学招生信息English
教学信息

Copyright ? 2011 http://inc.swjtu.edu.cn 西南交通大学信息网络中心



-----------------------------------------------------------------
登录帮助返回首页交大主页




蔡小强主页:个人信息科研项目论文著作荣誉奖励科研团队课程教学招生信息English
招生信息
[1]管理科学与工程专业博士

[2]管理科学与工程专业硕士
Copyright ? 2011 http://inc.swjtu.edu.cn 西南交通大学信息网络中心



-----------------------------------------------------------------
登录帮助返回首页交大主页




蔡小强主页:个人信息科研项目论文著作荣誉奖励科研团队课程教学招生信息English
Basic Information
Cai Xiaoqiang,Professor

Ph.D supervisor

Department of Management Science

Southwest Jiaotong University

Chengdu, Sichuan, 610031 P.R.China
Contact Information
Tel:

Fax:

E-mail: caixiaoqiang@home.swjtu.edu.cn

Education Background:
He received his B.Eng. degree from the Harbin Shipbuilding Engineering Institute in 1982 and his M.Eng. and D.Eng. degrees from Tsinghua University in 1985 and 1988 respectively. During 1989-91, he conducted postdoctoral research at The University of Cambridge and The Queen's University of Belfast.
Working Experience:
He was Lecturer at The University of Western Australia in 1991-1992, before joining CUHK in 1993. He served as the Head of Department of SEEM during 1996-2003, and has been Professor since October 2000.
Books and papers:
[1]X. Cai, J. Chen, Y.B. Xiao, and X.L. Xu, "Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline". Computers and Operations Research. Vol. 35, pp. 1671-1683. 2008.

[2]X. Cai, X.Y. Wu, and X. Zhou, "Single-machine scheduling with general costs under compound-type distributions". Journal of Scheduling. Vol. 10, pp. 77-84. 2007.

[3]X.P. Song and X. Cai, "On optimal payment time for a retailer under permitted delay of payment by the wholesaler", International Journal of Production Economics, Vol. 103, pp.246-251, June 2006.

[4]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. Vol. 2, pp. 158-172, April 2005.

[5]A.S.F. Ng, T. Sastry, J. Leung, and X. Cai, "On the Uncapacitated K-Commodity Network Design Problem with Zero Flow-Costs". Naval Research Logistics. Vol. 51, pp. 1149-1172, 2004.

[6]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, Vol. 51, pp. 800-817, 2004.

[7]X. Cai and X. Zhou, "Deterministic and Stochastic Scheduling with Team-Work Tasks". Naval Research Logistics, Vol. 51, pp. 818-840, 2004.

[8]X. Cai, K.L. Teo, X.Q. Yang, and X.Y. Zhou,"Minimax Portfolio Optimization: Empirical Numerical Study". Journal of The Operational Research Society, Vol. 55, pp 65-72. 2004

[9]X. 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, Vol. 17, pp. 467-485. December 2003.

[10]George Vairaktarakis, and X. Cai, "The Value of Processing Flexibility in Multipurpose Machines". IIE Transactions on Scheduling and Logistics, Vol. 35, pp. 763-774. 2003.

[11]G.C. Zhang, X. Cai, C.-Y. Lee, and C.K. Wong, "Minimizing Makespan on a Single Batch Processing Machine with Nonidentical Job Sizes". Naval Research Logistics, Vol. 48, pp. 226-240. 2001.

[12]X. Cai, K.L. Teo, X.Q. Yang, and X.Y. Zhou, "Portfolio Optimization under a Minimax Rule". Management Science, Vol. 46, pp. 957-972. 2000.

[13]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. Vol. 16, pp. 824-830. December 2000.

[14]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,Vol.47, pp. 422-437, 1999.

[15]C.L. Li, X. Cai and C.Y. Lee, "Machine Scheduling withMultiple-Job-On-One-Processor Pattern". IIE Transactions on Scheduling and Logistics, Vol. 30, pp. 433-446, 1998.

[16]X. 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, Vol. 30, pp. 481-494. 1998
Copyright ? 2011 http://inc.swjtu.edu.cn 西南交通大学信息网络中心