4 citations · 5 across the 5 of their papers we have counts for
5 papers
A 2-Competitive Largest Job on Least Loaded Machine Online Algorithm based on Multi Lists Scheduling Model
Debasis Dwibedy, Rakesh Mohanty
Online scheduling in identical machines with makespan minimization has been a well studied research problem in the literature. In online scheduling, the scheduler receives a list o…
A New Fairness Model based on User's Objective for Multi-user Multi-processor Online Scheduling
Debasis Dwibedy, Rakesh Mohanty
Resources of a multi-user system in multi-processor online scheduling are shared by competing users in which fairness is a major performance criterion for resource allocation. Fair…
Online Scheduling with Makespan Minimization: State of the Art Results, Research Challenges and Open Problems
Debasis Dwibedy, Rakesh Mohanty
Online scheduling has been a well studied and challenging research problem over the last five decades since the pioneering work of Graham with immense practical significance in var…
New Competitive Analysis Results of Online List Scheduling Algorithm
Rakesh Mohanty, Debasis Dwibedy, Shreeya Swagatika Sahoo
Online algorithm has been an emerging area of interest for researchers in various domains of computer science. The online -machine list scheduling problem introduced by Graham h…
Online Rainbow Coloring In Graphs
Debasis Dwibedy, Rakesh Mohanty, Arun Khamari
Rainbow coloring is a special case of edge coloring, where there must be at least one path between every distinct pair of vertices that consists of different color edges. Here, we…