Dr. Abhishek Awasthi

Short CV

07/2012 - 04/2017

Research Associate at Faculty of Electrical Engineering and Computer ScienceUniversity of Applied Science Zittau/Görlitz

05/2013 - 12/2016

PhD in Computer Science from undefinedCarl von Ossietzky University of Oldenburg, Germany
(PhD Thesis: Optimization of NP-hard Scheduling Problems by Developing Timing Algorithms and Parallelization)

09/2010 - 09/2012

Master of Science in Mathematical Modeling in Engineering: Theory, Numerics, Applications, undefinedErasmus Mundus MathMods: undefinedUniversity of L'Aquila, undefinedUniversity of Hamburg, undefinedAutonomous University of Barcelona
(Master's thesis: Clustering Algorithms to detect Money Laundering at undefinedAdvanced Computer Application Inc., Barcelona)

08/2006 - 08/2010

Bachelor of Technology in Engineering Physics at undefinedIndian Institute of Technology, Delhi, India
(Bachelor's Thesis: Design of Gas Sensors)

05/2009 - 07/2009

Bachelor Degree Internship: Simulation of Optical Parametric Oscillator for tuneable wavelength generation at Defence Research and Development Organization, Dehradoon, India

06/2008 - 08/2008

Bachelor Degree Internship: Design and Simulation of a 3D optical camera for Microassembly at undefinedTU Braunschweig, Germany

Working Fields

  • Combinatorial Optimization, Scheduling Algorithms, Metaheuristics, Mathematical Programming, Parallel Programming (CUDA), Modeling and Simulation of Logistic Systems

 

Related Publications

  • A. AWASTHI, J. LÄSSIG, T. WEISE, O. KRAMER. Tackling Common Due Window Problem With a Two-layered Approach, In 10th International Conference on Combinatorial Optimization and Applications (COCOA 2016), Springer Lecture Notes in Computer Science, Vol. 10043, DOI: 10.1007/978-3-319-48749-6, pp. 772-781, December 2016, Hong Kong [BibTex] [undefinedonline resource]
  • A. AWASTHI, J. LÄSSIG, J. LEUSCHNER, T. WEISE. GPGPU-based Parallel Algorithms for Scheduling Against Due Date. IEEE International Parallel & Distributed Processing Symposium Workshops (IPDPSW-PCO 2016), DOI 10.1109/IPDPSW.2016.66, pp. 766-775, May 2016, Chicago, USA. [BibTex] [undefinedonline resource]
  • A. AWASTHI, J. LÄSSIG, O. KRAMER. Un-restricted Common Due-Date Problem with Controllable Processing Times: Linear Algorithm for a Given Job Sequence. 17th International Conference on Enterprise Information Systems (ICEIS 2015), April 2015, Barcelona, Spain, Best Paper Award Nomination, ISBN 978-989-758-096-3, pp. 526-534, 2015, Barcelona, Spain. [BibTex] [undefinedonline resource]
  • J. LÄSSIG, A. AWASTHI, O. KRAMER. Common Due-Date Problem: Linear Algorithm for a Given Job Sequence. 17th IEEE International Conferences on Computational Science and Engineering (CSE 2014), December 2014, Chengdu China, pp. 97-104, ISBN 978-1-4799-7980-6. [BibTeX] [undefinedpdf] [undefinedonline resource]
  • A. AWASTHI, J. LÄSSIG, O. KRAMER, T. WEISE. Common Due-Window Problem: Polynomial Algorithms for a Given Processing Sequence. IEEE Symposium on Computational Intelligence in Production and Logistics Systems (SSCI-CIPLS) 2014, Orlando, USA, pp. 23-39, DOI 10.1109/CIPLS.2014.7007158. [BibTeX] [undefinedpdf] [undefinedonline resource]
  • A. AWASTHI, J. LÄSSIG, O. KRAMER. A Novel Approach to the Common Due-Date Problem on Single and Parallel Machines, Solving Computationally Extensive Engineering Problems: Methods and Applications, Springer International Publishing Switzerland, September 2014, pp. 293-314, ISBN 978-3-319-08984-3. [BibTeX] [undefinedarXiv] [undefinedonline resource]
  • A. AWASTHI, O. KRAMER, J. LÄSSIG. Aircraft Landing Problem: An Efficient Algorithm for a Given Landing Sequence. In Proceedings ot the 16th International IEEE Conference on Computational Science and Engineering (CSE 2013), December 2013, Sydney, Australia, pp. 10-17, ISBN: 978-0-7695-5096-1. [BibTeX] [undefinedpdf] [undefinedarXiv] [undefinedonline resource]
  • A. AWASTHI, J.LÄSSIG, O. KRAMER.  Common Due-Date Problem: Exact Polynomial Algorithms for a Given Job Sequence. In Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing 2013 (SYNASC 2013), September 2013, Romania, pp. 258-264, ISBN: 978-1-4799-3036-4. [BibTeX] [undefinedpdf] [undefinedarXiv] [undefinedonline resource]

 

Projects

Letzte Änderung:10. Januar 2018

Coordinates

 

formerly post address:
Hochschule Zittau/Görlitz
Obermarkt 17
D-02826 Görlitz
Germany

undefineda.awasthi@hszg.de

Anmelden
Direktlinks & Suche