Lin Chen

CONTACT INFORMATION
  • Tel: (+49) 89 289-16850
  • Email: chenlin198662@gmail.com
  • Address: Room MA 511, Department of Mathematics, Technical University of Munich, D-85747 Garching, Munich, Germany
RESEARCH INTERESTS
  • Scheduling, bin packing and knapsack problems
  • Approximation algorithms
  • Complexity theory and inapproximability
  • Algorithmic game theory
EDUCATION
  1. Zhejiang University, Zhejiang, P.R.China
    • B.S. Mathematics and Applied Mathematics, 2008
    • Ph.D. Computer Science, June 2013
      --Joint Ph.D project by China Scholarship Council: Studying in Kiel University, Germany
      from October 2011 to September 2012
  2. Technical University of Berlin, Berlin, Germany
    • Post doctoral position in the Emmy Noether Junior Research Group, October 2013 to August 2015.
      --Visiting Sydney algorithms group, University of Sydney in October 2014.
  3. Technical University of Munich, Munich, Germany
    • Post doctoral position in the Emmy Noether Junior Research Group, since September 2015.
RESEARCH WORK
  • Chen, L., Megow, N., Schewior, K.: An O(log m)-competitive algorithm for online machine minimization. To appear in the 27th ACM-SIAM Symposium on Discrete Algorithms (SODA 2016).

  • Chen, L., Megow, N., Rischke R., Stougie, L.: Stochastic and robust scheduling in the cloud. In Proceedings of the 18th Approximation Algorithms for Combinatorial Optimization and 19th Randomization and Approximation Techniques in Computer Science (APPROX-RANDOM 2015), 175--186.

  • Chen, L., Megow, N., Rischke R., Stougie, L., Verschae, J.: Optimal algorithms and a PTAS for cost-aware scheduling. In Proceedings of the 40th Mathematical Foundations of Computer Science (MFCS 2015), 211--222.

  • Chen, L., Ye, D.S., Zhang, G.C.: Approximating the optimal algorithm for online scheduling problems via dynamic programming. Asia-Pacific Journal of Operational Research, 32(1), 2015

  • Chen, L., Jansen, K., Zhang, G.C., On the optimality of approximation schemes for the classical scheduling problem. In Proceedings of the 25th ACM-SIAM Symposium on Discrete Algorithms (SODA), 657-668, 2014

  • Chen, L., Ye, D.S., Zhang, G.C., Online Scheduling of mixed CPU-GPU jobs. International Journal of Foundations of Computer Science, 25(6), 745-762, 2014

  • Chen, L., Ye, D.S., Zhang, G.C., An asymptotic competitive scheme for online bin packing. In Proceedings of Combinatorial Optimization and Applications 8th International Conference (COCOA), 13-24, 2014

  • Chen, L., Ye, D.S., Zhang, G.C., An improved lower bound for rank four scheduling. Operations Research Letters, 42, 348-350, 2014

  • Chen, L., Ye, D.S., Zhang, G.C., Online Scheduling on a CPU-GPU Cluster. In Proceedings of the 10th annual conference on Theory and Applications of Models of Computation (TAMC),1-9, 2013.

  • Chen, L., Zhang, G.C., Approximation algorithms for a bi-level knapsack problem. Theoretical Computer Science, 497, 1-12, 2013.

  • Luo, W.C., Chen, L., Zhang, G.C., Approximation schemes for two-machine flow shop scheduling with two agents.Journal of Combinatorial Optimization, 24(3), 229-239, 2012.

  • Luo, W.C., Chen, L., Approximation schemes for scheduling a maintenance and linear deteriorating jobs Approximation schemes for scheduling a maintenance and linear deteriorating jobs., Journal of Industrial and Management Optimization, 8(2), 271-283, 2012.

  • Xu, H.F., Chen, L., Ye, D.S., Zhang, G.C., Scheduling on two identical machines with a speed-up resource. Information Processing Letters 111(17), 831-835, 2011

  • Chen, L., Zhang, G.C., Approximation algorithms for a bi-level knapsack problem. In: Combinatorial Optimization and Applications 5th International Conference (COCOA), 399-410, 2011

  • Chen, L., Luo, W.C., Zhang, G.C., Approximation algorithms for unrelated machine scheduling with an energy budget. In: Proceedings of the joint conference of the fifth International Frontiers of Algorithmics Workshop and the seventh International Conference on Algorithmic Aspects of Information and Management (FAW-AAIM), 244-254, 2011

  • Luo, W.C., Chen, L., Zhang, G.C., Approximation algorithms for scheduling with a variable machine maintenance.. In: Proceedings of the the sixth International Conference on Algorithmic Aspects of Information and Management (AAIM), 209-219, 2010

  • Chen, L., Ye, D.S., Zhang, G.C., Parallel machine scheduling with speed-up resources. Submitted.

  • Chen, L., Luo, W.C., Zhang, G.C., Approximation algorithms for unrelated and identical parallel machine scheduling with an energy budget. Submitted.

  • Chen, L., Jansen, K., Luo, W.C., Zhang, G.C., Approximation algorithms for scheduling parallel machines with capacity constraints. Submitted.

My Curriculum Vitae