4 citations · 5 across the 11 of their papers we have counts for
8 papers · 1 filter
A Note on Hardness of Multiprocessor Scheduling with Scheduling Solution Space Tree
Debasis Dwibedy, Rakesh Mohanty
We study the computational complexity of the non-preemptive scheduling problem of a list of independent jobs on a set of identical parallel processors with a makespan minimization…
New Competitive Semi-online Scheduling Algorithms for Small Number of Identical Machines
Debasis Dwibedy, Rakesh Mohanty
Design and analysis of constant competitive deterministic semi-online algorithms for the multi-processor scheduling problem with small number of identical machines have gained sign…
Results on Competitiveness of Online Shortest Remaining Processing Time(SRPT) Scheduling with Special Classes of Inputs
Sheetal Swain, Rakesh Mohanty, Debasis Dwibedy
Shortest Remaining Processing Time (SRPT) is a well known preemptive scheduling algorithm for uniprocessor and multiprocessor systems. SRPT finds applications in the emerging areas…
Semi-online Scheduling: A Survey
Debasis Dwibedy, Rakesh Mohanty
In online scheduling, jobs are available one by one and each job must be scheduled irrevocably before the availability of the next job. Semi-online scheduling is a relaxed variant…
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…