Debasis Dwibedy

Orcid: 0000-0001-7690-8398

According to our database1, Debasis Dwibedy authored at least 13 papers between 2019 and 2023.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Semi-online Scheduling with Lookahead.
CoRR, 2023

A note on Hardness of Multiprocessor Scheduling with Scheduling solution Space Tree.
Comput. Sci., 2023

2022
Online List Scheduling for Makespan Minimization: A Review of the State-of-the-art Results, Research Challenges and Open Problems.
SIGACT News, 2022

Semi-online scheduling: A survey.
Comput. Oper. Res., 2022

2021
New Competitive Semi-online Scheduling Algorithms for Small Number of Identical Machines.
CoRR, 2021

New Results on Competitive Analysis of Online SRPT Scheduling.
Proceedings of the Seventh International Conference on Mathematics and Computing, 2021

A 2-Competitive Largest Job on Least Loaded Machine Online Algorithm Based on the Multi List Scheduling Model.
Proceedings of the Seventh International Conference on Mathematics and Computing, 2021

2020
Results on Competitiveness of Online Shortest Remaining Processing Time(SRPT) Scheduling with Special Classes of Inputs.
CoRR, 2020

A 2-Competitive Largest Job on Least Loaded Machine Online Algorithm based on Multi Lists Scheduling Model.
CoRR, 2020

A New Fairness Model based on User's Objective for Multi-user Multi-processor Online Scheduling.
CoRR, 2020

Online Scheduling with Makespan Minimization: State of the Art Results, Research Challenges and Open Problems.
CoRR, 2020

New Competitive Analysis Results of Online List Scheduling Algorithm.
CoRR, 2020

2019
Online Rainbow Coloring In Graphs.
CoRR, 2019


  Loading...