Dr. DEBASIS DWIBEDY
VIT-AP University, Shivam Infosystem, IIT, Veer Surendra Sai University of Technology, Amrita Vishwa Vidyapeetham, KIIT University
About
I am an academic researcher currently holding a position of Assistant Professor in the Department of Computer Science and Engineering at School of Computing, Amrita Vishwa Vidyapeetham, Coimbatore, Tamilnadu, India. I am interested in R & D on the Theoretical Aspects of Computing Science. Specifically, I am looking into Scheduling problems.
Previously, I hold various academic positions at prestigious Institutions like VSSUT, Burla, OSOU, Sambalpur, Odisha, MMU, Ambala, Haryana, India. In industry, I worked as a senior Software Engineer cum HR Executive at Accenture, Gurugram, and NIC Labs, Mohali, India.
In addition to academics, I have been serving as a domain expert in several industrial projects related to Scheduling.
My expertise includes problem formulation, feasibility studies, mathematical modeling, design, and analysis of algorithms. I am passionate about writing extended survey and review articles in the trendy areas of Computer Science.
My research interests span over emerging scheduling problems that arise in offline, online, and semi-online algorithmic frameworks. My particular focus is on the scheduling in Multiuser and Multiprocessor Systems. Currently, I am exploring algorithmic fairness in scheduling, where multiple users are involved and demand a fair approach to scheduling their respective jobs.
In semi-online scheduling, I am focusing on the lookahead models, where besides the processing time of the current job, an online algorithm knows the processing time of some future jobs. The central question that I address is: how much improvement in the competitiveness will be gained by considering lookahead over the pure online scheduling setting?
I have also been exposed to vertex coloring in graphs and contributed algorithms for the online rainbow coloring problem.
I joined into Ph.D. as a GATE-qualified full-time research Scholar at VSSUT, Burla in 2016. I successfully completed the pre-conference school on algorithms and discrete mathematics at IIT, Kharagpur in 2021. I presented scholarly articles at various International conferences organized at IIT Gandhinagar, BITS Pilani Goa, NIT Silchar, and IIEST Shibpur, INDIA. I did my M.Tech in CSE from KIIT University, Bhubaneswar, India in 2013 and completed my B. Tech in CSE from B.IE.T, Bhadrak under BPUT University, Rourkela in 2010.
Employment
-
VIT-AP University Assistant Professor (Senio Grade 2)2025 - Present
-
Amrita Vishwa Vidyapeetham Assistant Professor2023 - 2025
-
Veer Surendra Sai University of Technology Guest Faculty2023 - 2023
-
Shivam Infosystem Domain Expert2022 - Present
-
Veer Surendra Sai University of Technology Guest Faculty2018 - 2022
-
Odisha State Open University Academic Counsellor2017 - 2022
-
Maharishi Markandeshwar Group of Institutions Assistant Professor2014 - 2016
Education
-
IIT Indo-Italian Pre Conference School on Discrete Mathematics2019 - 2019
-
Veer Surendra Sai University of Technology Ph.D2016 - 2033
-
KIIT University M.Tech2011 - 2013
-
Biju Patnaik University of Technology B.Tech2006 - 2010
Projects & Funding
Projects & funding information is unavailable.
Publications (24)
- A NOTE ON HARDNESS OF MULTIPROCESSOR SCHEDULING WITH SCHEDULING SOLUTION SPACE TREE Save
- A Note on Hardness of Multiprocessor Scheduling with Scheduling Solution Space Tree Save
- Online List Scheduling with Makespan Minimization : A Review of the State-of-the-art Results, Research Challenges, and Open Problems Save
- Semi-online scheduling: A survey Save
- A New Fairness Model Based on User’s Objective for Multi-user Multi-processor Online Scheduling Problem Save
- A Note on Hardness of Multiprocessor Scheduling with Scheduling Solution Space Tree Save
- New Competitive Semi-online Scheduling Algorithms for Small Number of Identical Machines Save
- A new fairness model based on user's objective for multi-user multi-processor online scheduling Save
- Semi-online Scheduling: A Survey Save
- Results on competitiveness of online shortest remaining processing time(SRPT) scheduling with special classes of inputs Save