蒋义伟 - 浙江理工大学

个人简介

蒋义伟，教授、博士，硕士生导师。美国《数学评论》评论员；中国运筹学会排序分会理事。入选浙江省151人才第三层次、浙江省高校优秀青年教师资助计划和浙江理工大学521人才资助计划。浙江大学数学系博士，香港大学计算机系和美国The University of Texas at Dallas计算机系访问学者。

研究领域

排序理论组合优化算法设计与分析物流与供应链

近期论文

查看导师最新文章（温馨提示：请注意重名现象，建议点开原文通过作者单位确认）

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) 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) 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) 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) 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) 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) 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) Y. Jiang，J. Dong, M. Ji, Preemptive scheduling on two parallel machines with a single server, Computers & Industrial Engineering, 66, 514–518, 2013 (SCI) Q. Wei, Y. Jiang, Approximation algorithms for a two-stage hybrid flow shop, Journal of Software, 23(5):1073−1084，2012-5. (EI) 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) 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) 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) A. Zhang, Y. Jiang, Z. Tan, Online parallel machines scheduling with two hierarchies, Theoretical Computer Science, 410, 3597-3605, 2009-09. (SCI) Y. Jiang, A. Zhang, Z. Tan, Online coupon consumption problem, Journal of Combinatorial Optimization，16，1-15，2008-07. (SCI) Y. Jiang, Online scheduling on parallel machines with two GoS levels, Journal of Combinatorial Optimization，16，28-38，2008-07. (SCI) Y. Jiang, Y. He, Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information. Acta Informatica, 44, 571-590, 2007-12 (SCI) 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) 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) 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) Y. Jiang, Y. He: Semi-online algorithms for scheduling with machine cost, Journal of Computer Science & Technology, 21, 984-988, 2006. (SCI)