个人简介
刘朝晖，1970年10月生，数学系教授、博士生导师，目前担任中国运筹学会理事、中国运筹学会排序专业委员会常务理事、上海市运筹学会副理事长，2015年获宝钢优秀教师奖。
学习及工作经历
1988年9月-1992年6月就读于复旦大学运筹学专业，获学士学位
1992年9月-1998年6月就读于华东理工大学应用数学专业，获硕士、博士学位
1998年7月起就职于华东理工大学数学系
1999年10月-2000年10月在香港理工大学管理学系进行合作研究
2001年8月-2003年8月在香港理工大学管理学系、物流学系进行博士后研究
2005年7-9月在香港理工大学物流学系进行合作研究
近期论文
查看导师最新文章
（温馨提示：请注意重名现象，建议点开原文通过作者单位确认）
W Yu, Z Liu (2016) Improved Approximation Algorithms for Some Min-Max and Minimum Cycle Cover Problems, Theoretical Computer Science, 654, 45-58.
X Lu, Z Liu (2015) Online hierarchical scheduling on two uniform machines with bounded job sizes, Asia-Pacific Journal of Operational Research, 32(5), 1550032 (31pages).
W Yu, Z Liu, X Bao (2014) Optimal Algorithms for Some Variants of Online Quota Traveling Salesman Problem, European Journal of Operational Research, 238(3), 735-740.
W Yu, Z Liu (2014) Vehicle Routing Problems with Regular Objective Functions on a Path, Naval Research Logistics, 61(1), 34-43.
S Zhou, Z Liu (2013)A Theoretical Development for the Total Tardiness Problem and Its Application in Branch and Bound Algorithms, Computers & Operations Research, 40(1), 248-252.
W Yu, Z Liu, L Wang, T Fan (2011) Routing Open Shop and Flow Shop Scheduling Problems, European Journal of Operational Research, 213(1), 24-36.
W Yu, Z Liu (2011)Single-vehicle Scheduling Problems with Release and Service Times on a Line, Networks, 57(2), 128-134.
Q Cao, Z Liu (2010)Semi-online Scheduling with Known Maximum Job Size on Two Uniform Machines, Journal of Combinatorial Optimization, 20(4), 369-384.
W Yu, Z Liu (2009) Vehicle routing problems on a line-shaped network with release time constraints, Operations Research Letters, 37(2), 85-88.
Z Liu, TCE Cheng (2005) Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine, Theoretical Computer Science, 347, 288-298.
Z Liu, TCE Cheng (2004) Minimizing total completion time subject to job release dates and preemption penalties, Journal of Scheduling, 7, 313-327.
TCE Cheng, Z Liu (2004) Parallel machine scheduling to minimize the sum of quadratic completion times, IIE Transactions, 36(1), 11-17.
TCE Cheng, Z Liu (2003) Approximability of two-machine no-wait flowshop scheduling with availability constraints, Operations Research Letters, 31(4), 319-322.
Z Liu, JJ Yuan, TCE Cheng (2003) On scheduling an unbounded batch machine, Operations Research Letters, 31(1), 42-48.
TCE Cheng, Z Liu, Y.M. Shafransky (2001) A note on the complexity of family scheduling to minimize the number of late jobs, Journal of Scheduling, 4(4), 225-229.
TCE Cheng, Z Liu, W Yu (2001) Scheduling jobs with release dates and deadlines on a batch processing machine, IIE Transactions, 33(8), 685-690.
Z Liu, W Yu (2000) Scheduling one batch processor subject to job release dates, Discrete Applied Mathematics, 105(1-3), 129-136.
Z Liu, W Yu (1999) Minimizing the number of late jobs under the group technology assumption, Journal of Combinatorial Optimization, 3(1), 5-15.
俞文鱼此，刘朝晖〔1999〕两台机器若干作业问题的双向排序法，华东理工大学学报，25 卷 6 期，629-633.
俞文鱼此，刘朝晖〔1997〕总延误问题顺时安排法的性能比，运筹学学报，1 卷 1 期，89-96.
京公网安备 11010802027423号