个人简述:

蒋义伟，教授、博士，硕士生导师。美国《数学评论》评论员；中国运筹学会排序分会理事。入选浙江省151人才第三层次、浙江省高校优秀青年教师资助计划和浙江理工大学521人才资助计划。浙江大学数学系博士，香港大学计算机系和美国The University of Texas at Dallas计算机系访问学者。主持国家自然科学基金2项，浙江省自然科学基金2项，浙江省高校优秀青年教师资助项目1项。获浙江省高校科研成果二等奖一项（排名第一）。在Information Sciences, Acta Informatica, European Journal of Operational Research, Theoretical Computer Science, Journal of Combinatorial Optimization等国内外期刊发表论文50余篇，其中被SCI检索30篇，SCI期刊他引百余篇次。

1. 国家自然科学基金：MapReduce框架中的排序模型与算法(11571013)，2016.1-

2019.12，主持

2. 国家自然科学基金：可中断排序相关问题研究及其前沿应用(11001242)，2011.1-

2013.12，主持

3. 浙江省自然科学基金：带服务器的平行机调度问题研究(LY14A010031)，2014.1-

2016.12，主持

4. 浙江省自然科学基金：若干调度新问题的研究及其在服装生产中的应用(Y6090175)，

2010.1-2012.12，主持

5. 浙江省优秀青年教师资助计划项目：若干服装生产中的调度新问题研究，2010.1-

2010.12，主持

6. 国家自然科学基金：服装生产管理中的若干调度新模型及算法研究(11071220)，2011.1-

2013.12，排名2

7. 国家自然科学基金：在线库存及相关问题研究（11201428）2011.1-2013.12，排名2

8. 浙江省自然科学基金：服装供应链中多阶段集成应急调度问题研究(Y6090554)， 2010.1-

2012.12，排名2

科研工作:

获奖1. 带等级约束的在线调度问题研究，浙江省高等学校科研成果二等奖, 排名1, 2011代表性论文

28. Y. Jiang, F. Yu, P. Zhou, J. Hu, Online algorithms for scheduling on two parallel machines with a single server, International Transactions in Operational Research, 22, 913–927, 2015-8 (SCI)

27. Y. Jiang, Q. Zhang, J. Hu, J. Dong, M. Ji, Single-server parallel-machine scheduling with loading and unloading times, Journal of Combinatorial Optimization, 30, 201-213, 2015.(SCI)

26. A. Zhang, Y. Jiang, L. Fan, J. Hu, Optimal online algorithms on two hierarchical machines with tightly-grouped processing times, Journal of Combinatorial Optimization, 29(4), 781-795, 2015(SCI)

25. Y. Jiang, H. Wang, P. Zhou, An optimal preemptive algorithm for the single-server parallel-machine scheduling with loading and unloading times, Asia-pacific Journal of Operational Research, 31, 2014 (SCI)

24. Y. Jiang, Z. Weng, J.Hu，Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines, Journal of Combinatorial Optimization, 27(4), 711-723, 2014 (SCI)

23. Y. Jiang, J. Hu, L. Liu, Y. Zhu, T.C.E. Cheng, Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost, Information Sciences, 269, 128-141, 2014 (SCI)

22. Y. Jiang, J. Hu, Z, Weng. Liu, Y. Zhu, Parallel machine covering with limited number of preemptions, Applied Mathematics, A Journal of Chinese University, 29, 18-28, 2014 (SCI)

21. Y. Jiang，J. Dong, M. Ji, Preemptive scheduling on two parallel machines with a single server, Computers & Industrial Engineering, 66, 514–518, 2013 (SCI)

20. Q. Wei, Y. Jiang, Approximation algorithms for a two-stage hybrid flow shop, Journal of Software, 23(5):1073−1084，2012-5. (EI)

19. Y. Jiang, An Zhang, J.L.Hu，Optimal online algorithms on two hierarchical machines with resource augmentation, Discrete Mathematics, Algorithms and Applications，4，155-167，2012-3（also in COCOON’2011, LNCS, 6842, 638-648, 2011-8） (EI)

18. A. Zhang, Y. Jiang, Z. Tan, Online and semi-online scheduling on capacitated two-parallel machines, Asia-pacific Journal of Operational Research, 28: 163-182, 2011-4 (SCI)

17. Y. Jiang, L.Liu, B. Wu, E. Yao, Inverse minimum cost flow problems under the weighted Hamming distance, European Journal of Operational Research, 207(1), 50-54, 2010-11. (SCI)

16. A. Zhang, Y. Jiang, Z. Tan, Online parallel machines scheduling with two hierarchies, Theoretical Computer Science, 410, 3597-3605, 2009-09. (SCI)

15. Y. Jiang, A. Zhang, Z. Tan, Online coupon consumption problem, Journal of Combinatorial Optimization，16，1-15，2008-07. (SCI)

14. Y. Jiang, Online scheduling on parallel machines with two GoS levels, Journal of Combinatorial Optimization，16，28-38，2008-07. (SCI)

13. Y. Jiang, Y. He, Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information. Acta Informatica, 44, 571-590, 2007-12 (SCI)

12. Y. He, S. Han, Y. Jiang, Online algorithms for scheduling with machine activation cost, Asia-pacific Journal of Operational Research, 24, 263-277, 2007-04. (SCI)

11. S. Han, Y. Jiang, J. Hu, Online algorithms for scheduling with machine activation cost on two uniform machines, Journal of Zhejiang University SCIENCE, 8(1), 127-133，2007-01. (SCI)

10. Y. He, Y. Jiang, H. Zhou: Optimal preemptive online algorithm for scheduling with known largest size on two uniform machines, Acta Mathematica Sinica, English Series, 23，165-174，2007-01. (SCI)

9. Y. Jiang, Y. He: Semi-online algorithms for scheduling with machine cost, Journal of Computer Science & Technology, 21, 984-988, 2006. (SCI)

8. Y. He, H. Zhou, Y. Jiang: Preemptive semi-online algorithms with known total size, Acta Mathematica Sinica, English Series, 22, 587-594, 2006. (SCI)

7. Y. Jiang, Y. He: Optimal preemptive online algorithm for scheduling tightly-grouped jobs on two uniform machines, Asia-pacific Journal of Operational Research, 23, 77-88, 2006. (SCI)

6. Y. Jiang, Y. He, C. Tang: Optimal online algorithms for scheduling on two identical machines under a grade of service, Journal of Zhejiang University Science, 7, 309-314, 2006. (EI)

5. Y. Jiang, Z. Tan, Y. He: Preemptive machine covering on parallel machines, Journal of Combinatorial Optimization, 10, 345-363, 2005. (SCI)

4. Y. Jiang, Y. He: Preemptive online algorithms for scheduling with machine cost, Acta Informatica, 41, 315-340, 2005. (SCI)

3. Y. He, Y. Jiang: Optimal semi-online preemptive algorithms for machine covering on two uniform machines, Theoretical Computer Science, 339, 293-314, 2005. (SCI)

2. Y. He, Y. Jiang: Preemptive semi-online scheduling with tightly-grouped processing times, Journal of Computer Science & Technology, 19, 733-739, 2004. (SCI)

1. Y. He, Y. Jiang: Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines, Acta Informatica, 40, 367-383, 2004. (SCI)